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
Thanks