Login / Signup

Question

Which of the following sorting algorithms has the BEST average-case time complexity?

A Bubble Sort — O(n²)

B Insertion Sort — O(n²)

C Selection Sort — O(n²)

D Merge Sort — O(n log n)

E Gnome Sort — O(n²)

Practice Next

More Algorithms Questions

For a comparison-based sorting algorithm, which lower bound applies to the worst-case number of comparisons?
What happens in a deadlock situation in an operating system?
In which traversal strategy does the algorithm explore all the neighbor nodes at the present depth prior to moving on to nodes at the next depth level? ...
Which of the following sorting algorithms is a non-comparison-based sort?
Which of the following algorithms is most appropriate for a sorting task that requires minimal auxiliary space?
Which of the following sorting algorithms has a worst-case time complexity of O(N log N)?
Which algorithm is used to detect cycles in a directed graph?
Which type of firewall operates at the application layer of the OSI model and inspects incoming and outgoing data packets?
In a binary search tree (BST), what is true about the left child of a node?
What is the default replication factor in HDFS?

Relevant for Exams:

Central Bank of India SO

Hey! Ask a query

ask-question