Question
Which sorting algorithm has O(n log
n) average case?
Solution
Merge sort uses divide & conquer with O(n log n).
More Data Structure Questions
- In a data warehouse, which of the following best describes the concept of "data granularity"?
- What is the space complexity of storing an adjacency matrix for a graph with V vertices and E edges?
- Internet of Things (IoT) In an IoT ecosystem, which protocol is most efficient for constrained devices communicating over lossy networks?
- Which data structure uses FIFO (First In, First Out)?
- Deletion in Red-Black Trees maintains balance using:
- What is the time complexity of searching for an element in a sorted array using binary search?
- What is the primary purpose of a B+ Tree in a database management system?
- Which I/O scheduling algorithm is most suitable for minimizing seek time in hard drives?
- Which of the following best describes the function of the Control Unit (CU) in the CPU?
- Which of the following scenarios violates Boyce-Codd Normal Form (BCNF) in a relational schema?
