Been self study Database, from database I deep dived into sorting
algorithms.
Databases can do in-memory QuickSort. It also has an on-disk MergeSort.
For MergeSort: I follow this tutorial https://youtu.be/6pV2IF0fgKY?t=1108
(around 1 minutes only)
But I am still not fully understanding about *nlogn*. I understand how many
passes it will take, that is* logn. *
Yes each pass will sort N elements.
But I still don't get the *N* stand f*or in n*logn.*
Why does each pass take
*n time to sort it? *