Best sorting if elements are already sorted

  • Interview Candidate
  • 9
  • 3472

Showing Answers 1 - 9 of 9 Answers

Anitha

  • May 30th, 2005
 

Insertion sort!

  Was this answer useful?  Yes

Gaurav

  • Dec 8th, 2005
 

Bubble sort is d right answer

  Was this answer useful?  Yes

rama moahan

  • Jul 8th, 2006
 

Merge sort takes advantage of the ease of merging already sorted lists into a new sorted list.

  Was this answer useful?  Yes

Amrita Chakraborty

  • Mar 27th, 2007
 

Quicksort is the best sorting if elements are already sorted.

  Was this answer useful?  Yes

kevin

  • Apr 14th, 2007
 

insertion sort is the best sort when the list is already sorted as the no of comparision reduces its complexity is n.
quick sort is best when the pivot variable is in the middle of the list 
regards
kevein

  Was this answer useful?  Yes

Give your answer:

If you think the above answer is not correct, Please select a reason and add your answer below.

 

Related Answered Questions

 

Related Open Questions