I found the derivation of the Big O for mergesort to be pretty confusing from this video, so I looked into it a little bit more until I felt good about it.
It is helpful to know that mergesort is indeed best considered as O(nlogn), but note that if you want to be exact, the algorithm is technically O(nlogn + n) (i.e. there are 32 steps for n=8), but we end up dropping the +n, which is not as significant a term.
How would the object for a problem involving recursion be written as the compiler doesn't know how many times will a particular function will be called ?
int main() { double size; if(size>=size of mouth ) break x=size/2;y=size/2; merge x and y
return 0; }
that lady is just using the buble sorting , she needs to use the the merge sorting divide it into two half and dip the left half them dip the right half and then merge them into her mouth
At the beginning of merge sort we had this list 48621753. Before final merge we had 24681357. Then, during last merge we decide wich number is smallest. But it's a selection sort and all previous merges seems to be unuseful.
Vocês poderiam permitir legendas em português como no video da semana 0.
You could enable subtitles in Portuguese as the week of video 0.
Hahaha…. Most Indians go through it. Never double-double.
I found the derivation of the Big O for mergesort to be pretty confusing from this video, so I looked into it a little bit more until I felt good about it.
For those that are curious/interested in getting a better handle on how exactly we arrive at O(nlogn), I suggest checking out this Khan Academy analysis of merge sort: https://www.khanacademy.org/computing/computer-science/algorithms/merge-sort/a/analysis-of-merge-sort
It is helpful to know that mergesort is indeed best considered as O(nlogn), but note that if you want to be exact, the algorithm is technically O(nlogn + n) (i.e. there are 32 steps for n=8), but we end up dropping the +n, which is not as significant a term.
Nice class!
I feel like that merging step requires some additional processing!?
A friend of mine posted this gif showing another function that uses recursion (factorial) and I think it kinda helps you to understand how merge sort works: https://blog.penjee.com/wp-content/uploads/2015/04/top-5-programming-animated-gifs_recursion-animted-gif.gif
How would the object for a problem involving recursion be written as the compiler doesn't know how many times will a particular function will be called ?
Anyone who doubledips is not a human in my point of view
double dip…. its like shes forcing others to eat her saliva…. its not about her… its about others…
superb lecture
int main()
{
double size;
if(size>=size of mouth )
break x=size/2;y=size/2;
merge x and y
return 0;
}
that lady is just using the buble sorting , she needs to use the the merge sorting
divide it into two half and dip the left half them dip the right half and then merge them into her mouth
At the beginning of merge sort we had this list 48621753.
Before final merge we had 24681357.
Then, during last merge we decide wich number is smallest. But it's a selection sort and all previous merges seems to be unuseful.
try to watch it at o.5 speed lol
waittttt hold on :'( I want to play that game, I can't find it. does anyone have the URl to get it?
Great lecture, almost non-stop
The puppies are so cute 🙂❤
yeah go pico yeah yeah go pico yeah