Hi all,

Im having trouble understanding the two sorting method. How do you find the number of comparison made by merge sort and quicksort? isit using the O(nlogn)?? What is it supposed to mean by " sort, by hand, the folllowing array... using a)merge sort b)quicksort


If you will notice, the viewer has the option to view the site in English. Notice the flag at the top right corner of the screen.

Sorting by hand generally means the teacher wants you to show the array after each step of the sort from start to finish.