Self-Review Exercises

16.1Fill in the blanks in each of the following statements:

  1. A selection sort application would take approximately _____ times as long to run on a 128-element array as on a 32-element array.

  2. The efficiency of merge sort is _____.

16.2What key aspect of both the binary search and the merge sort accounts for the logarithmic portion of their respective Big Os?
16.3In what sense is the insertion sort superior to the merge sort? In what sense is the merge sort superior to the insertion sort?
16.4In the text, we say that after the merge sort splits the array into two subarrays, it then sorts these two subarrays and merges them. Why might someone be puzzled by our statement that “it then sorts these two subarrays”?

Get Java™ How to Program, Seventh Edition now with the O’Reilly learning platform.

O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.

Start your free trial