Divide and Conquer: The Art of Breaking Down Problems | Recursion Series

[@vladicauca]

Thank you so much for the ilustrative explanation about divide and conquer, it is so clearly and inspiring !!

[@KeepTelling]

After your explanation and preudo-code I understood the whole thing immediately! Thank you for your educational work!

[@bantyK]

Yours is the only channel where I have clicked on the bell icon for notification, because I dont want to miss all these awesome content.

[@rayray66]

your visual of dividing and conquering the problem was really helpful for making recursion easier to understand. thank you.

[@prajwalchoudhary4824]

Awesome video William I watched your videos on graph now I feel comfortable solving most of the problems around that topic. Thanks you are the best

[@MoscleBrog]

i am one of the luckiest one to find you thank you Mr. Williams to save my GPA

[@YiHongLiu-y5v]

Thank you for your explaination! I have a question about the code of three way search. There are three sizes of interval (cases); why don't you use if, elif, else instead of if, if, if? I really appreciate your time!

[@adzxyz1950]

helped me immensely with wrapping my head around this

[@ah_dev]

this video is great and is helping me through a pretty badly explained DSA module! you've explained it much better, thanks.

[@anuchan-l7y]

we use this concept in implementation of segment trees .

[@mirroredimage577]

You are the Goat bro.

[@MoscleBrog]

i tried to attempt it my self but will this work? i did it a bit different.
mid= (j - i)/ 3
(i, mid, Lst)
(mid+1, j-mid-1, Lst)
(j-mid, j, Lst)

[@anuchan-l7y]

this concept is used in segment trees

[@entropeed9020]

could anyone explain the time complexity of this code

[@subee128]

thanks

[@varshneydevansh]

Thanks. Even I am trying to explain things is real world example way. for example, I tried to explain Linux directories with the game Age of empire and Computer memory organization with my university library. @kyuantym