Sorting Algorithms - Practice Test

(A) Radix sort performs better than quick sort when we have log n bits for every digit

(B) Radix sort has better cache performance than quick sort

(C) Radix sort has higher values of constant factor in asymptotic notation

(D) Radix sort takes more space than quick sort

(B) Radix sort has better cache performance than quick sort

(A) Bill Gates

(B) Jacob Goodman

(C) Christos Papadimitriou

(D) John Goodman

(D) John Goodman

(A) true

(B) false

(A) true

(A) True

(B) False

(B) False

(A) O(n log n)

(B) O(n 2 )

(C) O(n 2 log n)

(D) O(n log n 2 )

(A) O(n log n)

Sorting Algorithms - Study Mode