top button
Flag Notify
    Connect to us
      Facebook Login
      Site Registration

Facebook Login
Site Registration

A list is ordered from smaller to largest. Which sort would take the longest and shortest time to execute?

+1 vote
409 views
A list is ordered from smaller to largest. Which sort would take the longest and shortest time to execute?
posted Aug 12, 2015 by Mohammed Hussain

Share this question
Facebook Share Button Twitter Share Button LinkedIn Share Button

1 Answer

+1 vote

If we will compare by taking five sorting algo (Bubble, insertion, selection, merge, quick)

Then for already sorted order Bubble sort will take least time, as first pass only no swap will happen means list is already sorted.So best case will be O(n) , n is size of you list.

Worst case will be selection sort, as here every time you find your minimum element and place it in proper place, though already sorted you still have to check for minimum element in each traversal. so best case/ worst case is same O(n^2), selection sort will take more time to sort.

If you want to have graphical view you can visit this link
http://www.sorting-algorithms.com/nearly-sorted-initial-order

answer Aug 13, 2015 by Sachidananda Sahu
Contact Us
+91 9880187415
sales@queryhome.net
support@queryhome.net
#280, 3rd floor, 5th Main
6th Sector, HSR Layout
Bangalore-560102
Karnataka INDIA.
QUERY HOME
...