The selection sort 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
B) repeatedly locating the smallest value in the unsorted portion of the array and moving it toward the lower end of the array
You might also like to view...
If you link data in Excel to a PowerPoint chart and then change the data in Excel, the chart in PowerPoint will not be effected
Indicate whether the statement is true or false
Match the software with the category
Software Category 6. Diskedit a. guidance software 7. EnCase Forensic b. imaging and verification software 8. FTK Imager c. wiping program 9. ByteBack d. data recovery/extraction tool 10. The Coroner's Toolkit e. access data