Sorting Algorithms MCQ question and answer with solution | Data Structure MCQs

A. O(n)

B. O(n log n)

C. O(n²)

D. O(log n)

A. it is not an in place sorting algorithm

B. its every implementation is adaptive

C. it requires in order traversal of BST for sorting input elements

D. it is a stable sort

A. negative numbers

B. large numbers

C. small numbers

D. positive numbers

A. 3n-3 flips

B. 2n-4 flips

C. 2n-3 flips

D. 3n-2 flips

A. 27 59 49 37 15 90 81 39

B. 27 59 37 49 15 90 81 39

C. 27 59 39 37 15 90 81 49

D. 15 59 49 37 27 90 81 39

A. Frequency Scaling

B. Storage Virtualization

C. Parallel Processing

D. Neural Networking

A. Binary tree sort and quick sort have same running time

B. Binary tree sort used BST as work area

C. As the number of elements to sort gets larger, binary tree sort gets more and more efficient

D. Both quick sort and binary tree are in place sorting algorithms

A. O(1)

B. O(n)

C. O(log n)

D. O(n log n)

A. 5

B. 7

C. 9

D. 0

A. heap sort

B. cube sort

C. quick sort

D. bogosort