Entire Site
Free Trial
Safari Books Online is a digital library providing on-demand subscription access to thousands of learning resources.
- Create BookmarkCreate Bookmark
- Create Note or TagCreate Note or Tag
- DownloadDownload
- PrintPrint
Chapter 20. Searching and Sorting > Self-Review Exercises
Self-Review Exercises
| 20.1 | Fill in the blanks in each of the following statements:
|
| 20.2 | What key aspect of both the binary search and the merge sort accounts for the logarithmic portion of their respective Big Os? |
| 20.3 | In what sense is the insertion sort superior to the merge sort? In what sense is the merge sort superior to the insertion sort? |
| 20.4 | In 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”? |
