Interested to Buy Any Domain ? << Click Here >> for more details...
A list is ordered from smaller to largest when a sort is
called. Which sort would take the longest time to execute?
- 12 Answers
- 31400 Views
- I also Faced
- E-Mail Answers
Answer Posted / 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 |
Post New Answer View All Answers
Who invented data structure?
What is a list in data structure?
When will we get ArrayStoreException?
How do you reference all the elements in a one-dimension array?
How do you find the complexity of a selection sort?
Does arraylist extend list?
What are the applications of linked list?
What are the types of binary tree?
What is adt in data structure?
What are the differences between b tree and b+ tree?
Can we extend an array after initialization?
What is the difference between array list and vector list?
Define b-tree of order m?
What is the difference between ienumerable and list?
Why concurrenthashmap is fail safe?
