[Solved] How to make a Worst case in mergesort in c? [closed]
[ad_1] The way mergesort works is dividing the array in two arrays, recursively (logn times), untill being able to compare pairs of elements. Then it merges the recursively created arrays also sorting them at the same time. For some sorting algorithms (e.g. quicksort), the initial order of the elements can affect the number of operations … Read more