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

99998
396
4098
19.02.2019
Back To Back SWE

Back To Back SWE

7926750
217000
90
07.01.2017
US
Описание видео:

Free 5-Day Mini-Course: 🤍backtobackswe.com Try Our Full Platform: 🤍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: 🤍🤍youtube.com/watch?v=fHYVhCL4riM The Infinite Series 1 + 2 + 4 + 8 + ... : 🤍en.wikipedia.org/wiki/1_%2B_2_%2B_4_%2B_8_%2B_%E2%8B%AF Logarithm Rules: 🤍🤍chilimath.com/lessons/advanced-algebra/logarithm-rules/ HackerRank: 🤍🤍youtube.com/channel/UCOf7UPMHBjAavgD0Qw5q5ww Tuschar Roy: 🤍🤍youtube.com/user/tusharroy2525 GeeksForGeeks: 🤍🤍youtube.com/channel/UC0RhatS1pyxInC00YKjjBqQ Jarvis Johnson: 🤍🤍youtube.com/user/VSympathyV Success In Tech: 🤍🤍youtube.com/channel/UC-vYrOAmtrx9sBzJAf3x_xw

Кадры из видео
Why Is Merge Sort O(n * log(n))? The Really Really Long Answer.
Why Is Merge Sort O(n * log(n))? The Really Really Long Answer.
Why Is Merge Sort O(n * log(n))? The Really Really Long Answer.
Why Is Merge Sort O(n * log(n))? The Really Really Long Answer.
Тэги из видео
Комментарии пользователей:
Mauricio Velasco
2023-05-07 01:17:03

Wooo amazing!!
Thanks!

krazyman 50
2023-04-26 12:41:52

how will this help me land a job dog

Unique Crafter
2023-03-27 09:42:19

alJswNJ4P3U&t=6m10s 6:10

Sapokee
2023-03-25 16:28:09

This man is an absolute gold mine. Thank you so much, this is the clearest explanation of anything I have ever seen.

Oleg
2023-03-12 20:45:31

Really good!

Pedro Ribeiro
2023-01-21 18:56:56

I'm very thankful past this video. Thank u. Hello from Brasil!!

pettugani hari
2023-01-02 07:43:29

Awesome 👏

Divinity
2022-11-24 17:58:13

Great explanation. I got lost towards the last 6 minutes once the distribution started and couldn't follow anything after we arrived at n log n. :/ But will return to watch again :) great break down. Thanks.

Hao Ruikun
2022-11-11 23:31:51

My ivy-league college professor couldn't help me truly comprehend this time complexity, but you did it. I hope they fire that professor and hire you instead.

Clive Chen
2022-11-07 05:39:48

you totally deserve n^n number of likes😀

Zelda
2022-10-28 22:34:58

i would say you still need to watch few other videos to understand the concept of merge sort and the code as well, however he did great job explaining some concepts in this video, its amazingly helpful

Shivani Gupta
2022-10-28 12:42:18

I didn't get the point why he add 1 in last part.

Ra men
2022-10-17 15:08:04

I got to say that you are super AMAZING!!!
My professor just skipped the total process....
like T(8)=T(n/2)+T(n/2)+(n-1) then bombed Worst case O(nlogn)
You completely fill out all my gap about why that is O(nlogn)

Shishir Pai
2022-10-15 04:31:39

Everything makes perfect sense now! Thank you

Yuvraj Bansal
2022-09-23 07:58:04

Thank u so much, this video helped me a lot!

rabii zahir
2022-09-20 06:46:04

Thank you

Smikkelbeer
2022-09-03 21:06:55

I got so confused at alJswNJ4P3U&t=28m48s 28:48 because I forgot that 'i' was above the first '2' and didn't see it due to the light there lol...

Piero
2022-08-25 15:19:14

very good content*

SHUSHANT TIWARI
2022-08-24 07:05:45

Understanding this concept finally in my 1000th video.

Что ищут прямо сейчас
ride on отвязать от icloud Canada pr card โปรโมท line shop курс corona renderer макросы без отдачи error 525 cloudflare lada elargus Malissakiss Scirocco a and e Magicka Sorcerer PVE Build CHERY EXEED Iqos vs запчастинафорд financialfreedom Cocos2D зажигалка патогенеза caliber gameplay bpm
Похожие видео
29.01.2019
Deeply Understanding Logarithms In Time Complexities & Their Role In Computer Science

Deeply Understanding Logarithms In Time Complexities & Their Role In Computer Science

23.01.2019
Merge 2 Sorted Lists - A Fundamental Merge Sort Subroutine (

Merge 2 Sorted Lists - A Fundamental Merge Sort Subroutine ("Merge Two Sorted Lists" on LeetCode)

26.02.2019
Investigating Heap Sort - Why Is Heap Sort Θ(n * log(n))? An Even Longer Really Long Answer.

Investigating Heap Sort - Why Is Heap Sort Θ(n * log(n))? An Even Longer Really Long Answer.

14.02.2021
Big O Notation Series #9: Understanding Merge Sort

Big O Notation Series #9: Understanding Merge Sort

09.05.2023
Big O myths busted! (Time complexity is complicated)

Big O myths busted! (Time complexity is complicated)

20.06.2020
Merge Sort In Python Explained (With Example And Code)

Merge Sort In Python Explained (With Example And Code)

26.03.2019
The Quicksort Sorting Algorithm: Pick A Pivot, Partition, & Recurse

The Quicksort Sorting Algorithm: Pick A Pivot, Partition, & Recurse

28.02.2019
Asymptotic Bounding 101: Big O, Big Omega, & Theta (Deeply Understanding Asymptotic Analysis)

Asymptotic Bounding 101: Big O, Big Omega, & Theta (Deeply Understanding Asymptotic Analysis)

27.01.2018
Why does log(N) appear so frequently in Complexity Analysis?

Why does log(N) appear so frequently in Complexity Analysis?

27.09.2019
Mathematicians vs. Physics Classes be like...

Mathematicians vs. Physics Classes be like...

12.07.2021
Learn Merge Sort in 13 minutes 🔪

Learn Merge Sort in 13 minutes 🔪

17.05.2020
Merge Sort Visualized and Recursion Explained

Merge Sort Visualized and Recursion Explained

18.01.2016
Determining why MergeSort is Big O(nlogn)

Determining why MergeSort is Big O(nlogn)

03.02.2019
What Is Asymptotic Analysis? And Why Does It Matter? A Deeper Understanding of Asymptotic Bounding.

What Is Asymptotic Analysis? And Why Does It Matter? A Deeper Understanding of Asymptotic Bounding.