Big O Notation Series #6: Big O of N Factorial

Подписаться 48 тыс.

Просмотров 22 тыс.

50% 1

Big O of N Factorial: In this video you will learn how to visualize and understand big o of n factorial or O(n!).
More from this series: • Big O For Software Eng...
big o big -oh algorithm analysis asymptotic complexity computer science big o notation n factorial programming time and space complexity big o notation log n complexity log n time complexity log n time complexity example exponential time complexity factorial time complexity factorial time complexity analysis n factorial time complexity big o notation in data structure big o notation discrete math big o notation explained time complexity of algorithms log n Join the Discord to talk to me and the rest of the community!
/ discord

Опубликовано:

30 сен 2024

Ссылка:

Скачать:

Готовим ссылку...

Добавить в:

Мой плейлист

Посмотреть позже

Комментарии : 41

@suhasa5542 3 года назад

man you deserve more subscribers, thanks for simplifying, I have gone through so many videos and now i feel like i understand big O, thanks!

@kantancoding 2 года назад

That’s awesome man! Sky’s the limit 🚀 keep it up!

@kasiviswanath1784 2 года назад

Explanation is very simple and clear. Easy to comprehend and you deserve more viewership.

@kantancoding 2 года назад

Thank you for the positive feedback. I’m glad you think so 🙂

@fungusthemungus3754 6 месяцев назад

Thank you for the amazing video and explanation. I had a question: I thought Big O accounts for all the operations taken, in this case every loop and every call to the function, instead of just the final function call with f(0).

@kantancoding 6 месяцев назад

Hey! I think you might benefit from watching the entire series. we only care about the dominant term ❤

@fungusthemungus3754 6 месяцев назад

@kantancoding Thank you, for your reply ❤️ I will be watching the entire series.

@tenshii_92 3 года назад

This is the third or so video of yours I've watched. I liked it, saw you were at 999 subs, decided to be your 1k! Grats man!

@kantancoding 3 года назад

🤣😂 that’s awesome. I saw it sitting at 999 for a while 😅. Thank you very much for your support 🙏

@Carrymejane Месяц назад

11:19 😮 amazing

@myamzid123shah9 3 года назад

Thanks for the video and nice explanation. Do you have any plan to make data structures and algorithms videos?

@kantancoding 3 года назад

Thank you! I have a series on both data structures and algorithms: ru-vid.com/group/PL7g1jYj15RUMeIY778b8lvgUzdRFnEniI ru-vid.com/group/PL7g1jYj15RUP_Mri9ym6BdUais6_jvhrS I do plan on making more videos on both data structures and algorithms in the future as well.

@mrgeetu1 2 года назад

One of the best and simplest video ever to understand Big O notation. Thank you for posting :)

@kantancoding 2 года назад

I’m glad to hear that. That was the goal 🙂 thank you

@sharkPause1 3 года назад

I wonder if there are any programs with this exact complexity

@t6hp 9 месяцев назад

Thank you so much! I think you should add the word "Recursion Explained" to make this video reach an even greater audience.

@kantancoding 9 месяцев назад

That's a good idea! Thank you 😃

@bikashk665 2 года назад

Best explanation I have seen so far on the time complexity. I subscribed your chennal after I watched your first video

@kantancoding 2 года назад

That’s awesome 😎 thank you 🙏

@ashokyadavfqplmgxjia4668 Год назад

I can't believe that i understood this in one vedio.. thanks bro

@kantancoding Год назад

I’m glad! No problem 😉

@DarkSwitchJ84 2 года назад

It seems for me the complexity is O(n * n! * s), where N is the number input and s is the length of * printed each time n == 0

@kantancoding 2 года назад

A small hint. Printing the string "***************" is only one operation. We aren't looping through the string and printing each character, we are just printing the string.

@camiscooked 2 года назад

You only focus on the biggest of the 3 For example: 30! is much larger is comparison to 1 or 9, so much larger in fact it js negligible when we have to represent the time complexity