Merge sort Problem ??

You are running an arm-wrestling competition with four contestants. When two contestants are matched, the strongest one always wins, and there are no ties. Using Merge Sort, how many matches are needed to sort the competitors from weakest to strongest?

×

Problem Loading...

Note Loading...

Set Loading...