Question
What is the minimum number of comparisons that any comparison-based sorting algorithm needs in the worst case to sort 5 distinct elements?
More Data Structure Questions
- Which of the following is an effective countermeasure against Cross-Site Scripting (XSS) attacks in a web application?
- What is the worst-case time complexity of the QuickSort algorithm?
- What is the minimum number of moves required to solve the Tower of Hanoi puzzle with 10 disks?
- In the context of Management Information Systems (MIS), which of the following best describes the role of a decision support system (DSS)?
- Which algorithm is used for minimum spanning tree?
- Fibonacci Heaps support Decrease-Key in:
- What is the worst-case time to decrease a key in a binary min-heap?
- Which comparison-based sorting algorithm achieves its best-case time complexity of O(n) specifically when the input array is already sorted (or nearly sort...
- Which of the following best describes the function of the Control Unit (CU) in the CPU?
- Which of the following is the most critical success factor for the implementation of a Decision Support System (DSS) within an organization?
Hey! Ask a query
Please enter email id
The email must be a valid email address.
Please enter Mobile Number
Please enter valid Mobile Number
Please enter your Doubt
Think You're Ready for RBI Grade B?
RBI Grade B 2026 Phase 1 Memory Based Paper
- 200 Questions with Detailed Solutions
- Section-wise Coverage (GA, English, Quant & Reasoning)