A list is ordered from smaller to largest when a sort is called. Which sort wou

Categories >> Software >> Operating Systems >> Data Structures
Suggest New Category

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

Question Posted / guest

12 Answers
27836 Views
I also Faced
E-Mail Answers

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 longest ..

Answer / zeeshan

quick sort is the answer.....quick sort shows worst case
behaviour when the list is already sorted....

courtesy"" shaum series- data structures""

Is This Answer Correct ?

15 Yes

0 No

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

Answer / uma sankar pradhan

selection sort,quick sort,bubble sort
(all will take the same time and its time complexity is of
the order of n^2)
the time complexity for insertion sort when the list is
ordered from smaller to larger is O(n)
the time complexity for merge sort irrespective of the
order of the elements is O(nlogn)

Is This Answer Correct ?

16 Yes

2 No

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

Answer / udkl

Its Quick Sort !!!!!
Even I got Surpriced!!!

http://www.geocities.com/siliconvalley/network/1854/Sort1.
html

Is This Answer Correct ?

13 Yes

3 No

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

Answer / vinoth kumar.r

Quick sort's worst case is the one given in the question.
It exhibits selection sort type of procedure when the list
is sorted

Hence both :)

Is This Answer Correct ?

8 Yes

0 No

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

Answer / neha gundecha

Its Quick Sort

Is This Answer Correct ?

3 Yes

0 No

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

Answer / santosh

Quict Sort

Is This Answer Correct ?

2 Yes

0 No

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

Answer / rahul

Bubble Sort cannot be the answer, Because the MODIFIED BUBBLE SORT takes complexity of O(n) when the elements are arranged in a particular order..

Is This Answer Correct ?

1 Yes

0 No

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

Answer / rahul

When the elements are ordered in either Ascending or Descending order, Quick sort behaves Equivalent to Merge sort. Time complexity of O(nlogn) is taken for sorting.

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 longest ..

Answer / ntrphanikumar

I am not sure about the answer.

But I think the answer is "Selection Sort" whose order is
O(n^2) irrespective of the elements order.

I guess all other sorts somehow depend on the order of elements.

Is This Answer Correct ?

3 Yes

6 No

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

Answer / punit

selection sort.

Is This Answer Correct ?

3 Yes

7 No