The Quicksort algorithm works by
A) repeatedly comparing adjacent items and swapping them so smaller values come before larger values
B) repeatedly locating the smallest value in the unsorted portion of the array and moving it toward the lower end of the array
C) repeatedly taking the first value in the unsorted portion of the array and placing it at its proper place in the part of the array that is already sorted
D) partitioning the unsorted portion of the array into two sublists and a pivot and recursively sorting the two sublists
D) partitioning the unsorted portion of the array into two sublists and a pivot and recursively sorting the two sublists
You might also like to view...
Graphical user interface components that make it possible to add interactivity to a Web page are called ________
Fill in the blank(s) with correct word
Data moves toward and away from the CPU on the ____, whereas data travels inside the CPU on the ____
A) High bus; low bus B) Peripheral exchange; central route C) Distal data path; proximal data path D) External data bus; internal data bus