Sorting Algorithms - Study Mode

Show All Answers

[#461] What is the worst case time complexity of bead sort (S= sum of input elements)?

(A) O(n)

(B) O(S)

(C) O(n 2 )

(D) O(n log n)

Correct Answer

(B) O(S)

[#462] What is the best case time complexity of bead sort (S = sum of input elements)?

(A) O(n)

(B) O(S)

(C) O(n 2 )

(D) O(n log n)

Correct Answer

(A) O(n)

[#463] LSD radix sort requires . . . . . . . . passes to sort N elements.

(A) (w/logR)

(B) N(w/logR)

(C) (w/log(RN))

(D) (wN/log(N))

Correct Answer

(A) (w/logR)

[#464] What is a randomized quick sort?

(A) quick sort with random partitions

(B) quick sort with random choice of pivot

(C) quick sort with random output

(D) quick sort with random input

Correct Answer

(B) quick sort with random choice of pivot

[#465] What is an external sorting algorithm?

(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'

Correct Answer

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