DATA STRUCTURE AND ALGORITHMS MCQ SET 1(b)
1) Which one of the following is the tightest upper bound that represents the number of swaps required to sort n numbers using selection sort? (A) O(log n) (B) O(n) (C) O(n log n) (D) O(n^2) Answer (B) 2) Consider the following operation along with Enqueue and Dequeue operations on […]