Sorting Algorithms - Practice Test

(A) O(n)

(B) O(n log n)

(C) O(n 2 )

(D) O(log n)

(B) O(n log n)

(A) O(nlogn)

(B) O(logn)

(C) O(n)

(D) O(n 2 )

(C) O(n)

(A) Algorithm that uses tape or disk during the sort

(B) Algorithm that uses main memory during the sort

(C) Algorithm that involves swapping

(D) Algorithm that are considered 'in place'

(B) Algorithm that uses main memory during the sort

(A) 5

(B) 4

(C) 7

(D) 10

(D) 10

(A) True

(B) False

(A) True

Sorting Algorithms - Study Mode