A list is ordered from smaller to largest when a sort is
called. Which sort would take the longest time to execute?
- 12 Answers
- 27768 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
What is a hash in programming?
Why do we use linked lists?
What are the applications of linked list?
Is radix sort stable?
What are the types of binary tree?
In what areas do data structures are applied?
Are hash tables ordered?
What is the difference between hashset and arraylist?
What is a property class?
What do you mean by tree edge?
What are the difference between arraylist and linkedlist from the perspective of sorting?
What sorting algorithm does arrays sort use?
Which is better hashmap or treemap?
Is list an array?
What is data structures in computer science?
