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...
The balance factor of a node in an AVL tree is
a) the number of nodes below it b) the number of nodes above it c) the height of its right subtree minus the height of its left subtree d) the depth of the node from the root e) always positive
Which of the following import statements must be used in order to use the Color class?
a. import.javafx.scene.Paint.color; b. import.javafx.scene.paint.Color; c. import.javafx.paint.color; d. import.javafx.scene.Color;
Type some words on a command line without pressing RETURN. Now delete a character, a word, and the entire line as explained starting on Sobell, page 29.
What will be an ideal response?
To use an e-mail system you need all of the following, EXCEPT _____.
A. an Internet connection B. an e-mail account C. software to compose e-mail message D. word processing software