Question
Which of the following is true about the time complexity of Merge Sort?
Solution
Correct Option: Merge Sort (C) has a time complexity of O(n log n) in both the best and worst cases due to its divide-and-conquer approach, where the list is recursively split and merged. Why Other Options Are Wrong: A) O(n), O(n^2): Merge Sort does not have a quadratic time complexity in the worst case, nor does it achieve linear time in the best case. B) O(log n), O(log n): This is incorrect as merge sort deals with linear elements and requires O(n log n) time due to both sorting and merging. D) O(n), O(n log n): While some algorithms achieve linear time in the best case, Merge Sort consistently performs at O(n log n). E) O(n^2), O(n^2): This complexity is associated with algorithms like bubble sort in the worst case, not Merge Sort.
- Which of the following is true about the time complexity of Merge Sort?
- Which sorting algorithm uses the 'Divide and Conquer' strategy and what is its recurrence relation?
- Which of the following is NOT a common wireless security protocol?
- What is the primary goal of Cyber Security?
- Converting binary number 110001 to decimal will result in:
- What is the primary purpose of virtualization in cloud computing?
- In the context of inter-process communication (IPC), which of the following mechanisms is used to ensure that only one process accesses a resource at a tim...
- Which protocol is most commonly used for secure communication between IoT devices over the internet?
- Which of the following CPU scheduling algorithms is optimal for minimizing average waiting time but requires knowledge of future process execution times?
- In a Windows computing environment, which of the following tools is used to monitor system performance and resource utilization in real-time?
