Computer Science K to 12
Question 2 of 30
Competency 1—Knowledge of computational thinking and problem solving
DIRECTIONS: Read the question and select the best response.
A programmer would like to determine the most efficient algorithm for ordering a large, finite list of integers from largest to smallest. The programmer has the following information on several sorting algorithms.
Algorithm Average complexity selection sort n2 merge sort n log n bogosort n n ! shell sort n (log n)2
Which algorithm is likely to be most appropriate for this task?
- Enter to expand or collapse answer.Answer expanded
- Correct Response: B.