1. Categories >> Software >> Operating Systems >> Data Structures
  2. Suggest New Category

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

Question Posted / guest

Answers were Sorted based on User's Feedback



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

Answer / sourav naskar

quick sort cant be the answer as this methods works best
when the list is completely unsorted.In this the method
would have worked best if it is descendingly sorted.As it
is completely sorted the answer is insertion sort which
takes O(n).

Is This Answer Correct ?    1 Yes 2 No

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

Answer / sarvesh

insertion is answer....as there is no case of swapping as
no. are in ordered pair..so less time will will be taken

Is This Answer Correct ?    1 Yes 2 No

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

Answer / 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

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

Answer / sailakshmi.s

straight insertion

Is This Answer Correct ?    0 Yes 3 No

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

Answer / ganesan

quick sort

Is This Answer Correct ?    2 Yes 12 No

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

Answer / pavan

Quick Sort

Is This Answer Correct ?    2 Yes 12 No

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

Answer / dwiti

Selection Sort

Is This Answer Correct ?    0 Yes 12 No

Post New Answer

More Data Structures Interview Questions

Different Types of pattern?

0 Answers   Wipro,

Why do we use data structures?

0 Answers  

Why do we use arrays?

0 Answers  

List out the advantages of using a linked list?

0 Answers  

Does hashset allow duplicates?

0 Answers  




Differentiate bfs and dfs?

0 Answers  

Why quicksort is faster?

0 Answers  

Does linkedhashset allow duplicates?

0 Answers  

Are dictionaries mutable?

0 Answers  

Explain binary search tree?

0 Answers  

How to pass in data structure exam?

0 Answers  

What is max heapify?

0 Answers  

For more Data Structures Interview Questions Click Here
Categories