heap sort is the correct answer because it requires log(n) time where n is

A list is ordered from smaller to largest when a sort is
called. Which sort would take the shortest time to execute?

Question Posted / gautam

Answer Posted / gautam

heap sort is the correct answer because it requires log(n)
time where n is the number of nodes

Is This Answer Correct ?

0 Yes

1 No

Please Help Members By Posting Answers For Below Questions

Which programming language is best for data structures?

902

What is the use of threaded binary tree?

1002

Which sorting method is slowest?

971

Why is map not a collection?

865

What is the purpose of sorting algorithms?

990

What is meant by deque?

929

What are the advantages of sorting?

940

How efficient is bubble sort?

896

List the types of tree.

905

Define secondary clustering?

927

Can treeset contain null?

891

Why sorting algorithms are important?

952

What do you mean by the term “percolate down”?

907

Can you dynamically allocate arrays in expanded memory?

1047

What is an example of an array?

1055