MENU

Fun & Interesting

Why Is Merge Sort O(n * log(n))? The Really Really Long Answer.

Back To Back SWE 119,089 6 years ago
Video Not Working? Fix It Now

Free 5-Day Mini-Course: https://backtobackswe.com Try Our Full Platform: https://backtobackswe.com/pricing 📹 Intuitive Video Explanations 🏃 Run Code As You Learn 💾 Save Progress ❓New Unseen Questions 🔎 Get All Solutions Question: Analyze the total work that Merge Sort performs as an exact function of n, the length of the input list. My Old MergeSort Video: https://www.youtube.com/watch?v=fHYVhCL4riM The Infinite Series 1 + 2 + 4 + 8 + ... : https://en.wikipedia.org/wiki/1_%2B_2_%2B_4_%2B_8_%2B_%E2%8B%AF Logarithm Rules: https://www.chilimath.com/lessons/advanced-algebra/logarithm-rules/ ++++++++++++++++++++++++++++++++++++++++++++++++++ HackerRank: https://www.youtube.com/channel/UCOf7UPMHBjAavgD0Qw5q5ww Tuschar Roy: https://www.youtube.com/user/tusharroy2525 GeeksForGeeks: https://www.youtube.com/channel/UC0RhatS1pyxInC00YKjjBqQ Jarvis Johnson: https://www.youtube.com/user/VSympathyV Success In Tech: https://www.youtube.com/channel/UC-vYrOAmtrx9sBzJAf3x_xw

Comment