Divide & Conquer Algorithm In 3 Minutes

Divide & Conquer Algorithm/Pattern (Merge Sort, Merge Two Sorted Arrays) Join the Discord to talk to me and the rest of the community!
/ discord

[@matthewbridges3147]

Beautifully animated video, great explanation and delivery, thank you!

[@nasrimarc7050]

Very clear overview of how merge sort works , thank you so much

[@kantancoding]

No problem! Thanks for watching 🙂

[@christmasisawesome9348]

Thank you for the visualisation, good sir.

[@kantancoding]

You’re very welcome 😊

[@Seallbay]

Very good explanation. I’m currently doing my A-Levels and this helped me!

[@kantancoding]

Thank you! I’m sure you’ll do great 😊

[@Seallbay]

@@kantancoding thank you!

[@leandromarcelo2340]

hello, I loved your video and I would like to know how you do the animations of the arrangements and such, what kind of tools and/or technologies do you use?

[@kantancoding]

Hey thank you! I’m glad you liked it. For this video I use manim/python

[@CarlosLopez-fl6yf]

simple and efficient, thanks brother.

[@kantancoding]

Happy to help!

[@suggestaname1685]

Amazing video! can you please tell me which program you use to make these illustrations, they are fantastic!

[@kantancoding]

Thank you and sure, it's called manim

[@user-ez8bm6qy6k]

Very good explanation , thank you

[@kantancoding]

Happy to help! ☺️

[@Sebastian1832x]

Cool vid, very well done.

[@kantancoding]

Thank you 🙂

[@kyokokirigiri166]

Thanks I appreciate this

[@kantancoding]

Thank you! I’m happy to help

[@dex1444]

thanks, this was mentioned in money heist

[@kantancoding]

😂 no problem

[@River049]

This is probably crazy!😎

[@user-yd9xy3rb4x]

Wait a second this is a quick sort

[@kantancoding]

Yes, quicksort is based on divide and conquer ☺️

[@michaelglendinning1738]

Now..... give each of those boxes a personality. Nevermind.....I won't go there. I know who owns this popular video platform we all use.

[@kantancoding]

🤫

[@sssumeet]

what is the space complexity of merge sort?

[@kantancoding]

It depends on the implementation but the simple answer is O(n)

[@narendrakumar5338]

average time complexity of merge sort is O(nlogn)

[@920PC]

The first 30 seconds of this video is epic and is all is really needed the second half really just complicates things and doesn't explain anything.. I would have been more likely to click on this video if it was only a 1 minute video I went and searching for a different videos before watching this because it was so long.. I'm glad I came back because you explained it very well, articulated it in a way that I was unable to when trying to explain this to a friend I just wish the video would have stopped after 30 seconds or so. Either way thank you for posting

[@kantancoding]

Actually, that first example is an oversimplification to give the viewer a general understanding of the algorithm. That example alone isn’t enough to fully understand the algorithm which is why I progress the explanation by increasing the difficulty of the following example. Merge sort is a textbook example of divide and conquer. I’d question any video that attempts to teach divide and conquer without ever bringing up merge sort. If you can’t understand merge sort, you don’t understand the algorithm regardless of if the first example was intuitive for you or not. Also, if you are skipping a 3 minute video because it’s more than 1 minute, you’re likely not in the market to understand the algorithms deeply. This series is geared towards actually learning the algorithms deeply. I don’t compromise teaching quality for clicks. That’s why there’s so much trash educational content on KZbin now. But I actually do appreciate the feedback. Always good to understand the nuances in what people search for.

[@920PC]

@@kantancoding I will give you to you brother. That is one of the most mature and complete -- comprehensive, understandable, and level headed replies to a short sided comment that I have ever seen on KZbin.. Kudos my friend. I stand corrected. You are a great asset to this platform and I offer my sincere apology and great regard for your contribution to the audience here. Thank you for the upload. Keep coming my brother. GOD BLESS!!