Question
Develop an abstract version of quicksort (see Section 6.2.3). As in the abstract searching procedure from Section 6.1.3, you should assume that arbitrary records are to be sorted. The records have a key field that is used for comparisons.
Step 1
Assume each record has a key field which can be compared with keys of other records. The type of the key (e.g., integer, string) should be abstracted, meaning the quicksort algorithm should work regardless of the specific type of the key. Show more…
Show all steps
Your feedback will help us improve your experience
Watch the video solution with this free unlock.
EMAIL
PASSWORD