How many comparisons would be required if I had a list of X integers?

How many comparisons would be required if I had a list of X integers using the merge sort algorithm?

For example, I have a list of 500 integers, how many comparisons would be needed using merge sort to get the end result?

fractions. all of them.

This entry was posted in comparisons. Bookmark the permalink.

One Response to How many comparisons would be required if I had a list of X integers?

  1. Mr. Joseph says:

    fractions. all of them.
    References :