Factorial (n!) Algorithm Complexity & Traveling Salesman Problem - Data Structures and Algorithms

[@codingboy2254]

Underrated series of videos on data structures and algorithms . Should rank one on youtube.

[@wisdom-for-life]

100! = 9.3 ^ 157 :O That's a lot of computations. Thanks Caleb.. Very clear and simple as always!

[@shredderspencer1122]

100! = 9.3 * (10^157).

[@r.n.dspectra1775]

This is great lesson thank you Caleb 😍

[@alexandermuto7174]

This guy's awesome

[@milkman5894]

yoo bakugan

[@AkashYadav-rj6fn]

Loved it!! I am left handed too. And my handwriting is same as Caleb(or maybe worse)😂

[@kevinab3874]

Still a great video after 4 years

[@ayush.kumar_02]

Thanks caleb your explanation is great.....

[@egenethebest9107]

Hey Caleb! Great video, but for some reason when I download it (I have KZbin Premium), I am not able to change the playback speed. It might be something to do with the video codec you are using and for some reason KZbin processes your uploaded videos differently. I have tried informing KZbin of the issue, but they have not really done anything about it. Would you mind trying a different codec for your future videos? I like taking your tutorials on a plane or a long train ride and being able to download them (with KZbin Premium) is really helpful. But I watch all tutorials at 2x speed and with the codec you are using it does not work for downloaded videos (((

[@ادهماحمد-ب7ت]

For me, Caleb speaks pretty fast already😮😅

[@beastmaster4716]

why n-1 at 7:40

[@noelara4356]

I think that is n-1 because,from 4 of the cities he is already in one of them.

[@yasserakbbach7342]

I like the board approach explanation 👌

[@SiddharthRay1]

I like caleb style of teaching, but we need to be bit patience ❤

[@UnathiGX]

Thank you!

[@progtom7585]

Tsp explanation is great, thanks mate

[@nancykorayem6711]

great explanation, u have cleared a lot of things for me.. Thanks :)

[@bradensorensen966]

Traveling Salesman isn't N! though... You start at one city which can be any of the cities, so that can't be included. Then you go to all of the other cities in every permutation. Ending up at your starting city is inevitable so that isn't represented. This gives us (n-1)! at most. But, you have to factor in that each tour that mirrors an existing tour can be factored out giving us [(n-1)!]/2

[@ancatarca8047]

isn't that what he pretty much explained?

[@ighsight]

@@ancatarca8047 Yeah, that is what he explained. It's like this guy did not watch the video, since Caleb definitely writes [(n-1)!]/2 on the board.

[@paulascatarelli5348]

@@ancatarca8047 exactly

[@pranavnyavanandi9710]

Hello. I was wondering how the time complexity is n! at all. I drew out the recursion tree for a graph with 4 vertices. The number of recursive calls do not equal (n - 1)! and is much greater than that. The factorial only gives us the number of recursive calls at the end of the tree. Can you explain me how it should be done? It's adjacency matrix is 0 10 15 20 5 0 9 10 6 13 0 12 8 8 9 0 There are 15 recursive calls in total. 3! does not equal that.

[@zigginzag584]

python factorial algorith def fact(n): answer = 1 while n > 1: answer *= 1 n -= 1 return answer

[@johnlamo8385]

U rock bro 🤟

[@breakdancerQ]

Just a very clear explanation!

[@lautarozambella1887]

Really liked the video, great work!

[@utilizator1701]

At 1:55 you have forgotten to put the ! sign.

[@exomk5319]

why is it (n-1)! ????

[@ishitabhattacharyya1538]

because one node is already fixed. you start at A(say) and you end at A. then you are actually shuffling between B, C, D. as in, your paths will be like ABCDA, ABDCA, ACBDA, ACDBA, ADBCA, ADCBA. that sums up to 6 = 3!

[@mohammedbasher7083]

You the best Caleb

[@xiaonaiheme]

Great lessons

[@aymensekhri2133]

Thanks a lot

[@federicobau8651]

Nice vid pal

[@itzaprem6358]

Do you suggest your C++ Series or

[@mollybrazza1427]

really good!easy and clear!

[@sadhucat4476]

Great explanations!

[@Ibrahimlwaad]

Thanks !

[@belala.fattah6532]

👍🏾👍🏾

[@murugarajuperumalla5508]

thanks

[@thenewway416]

Awesome

[@thenewway416]

Amazing

[@divyaprakashks4789]

Thanks man

[@reverseworld5768]

Can I ask something I can't open my Php admin local host for the database I don't know what to do can you help me Do I need Internet to fix it or not? Thank you so much

[@thrillclip]

nice lesson but the ads are too much.. almost every 2mins there is an ad, it's so distracting