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
- 32287 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 the difference between hashset and arraylist?
What are dynamic data structures?
Which is the parent class of printerstatereasons class?
Should I use hashmap or hashtable?
Why sorting is used?
What is sorting problem?
Can a tree be empty?
Are linked lists considered linear or non-linear data structures?
Differentiate linear from a nonlinear data structure?
How do you find the number of comparisons in bubble sort?
Define hashing?
What does adt stands for?
What is bubble sort algorithm in data structure sort and searching?
Can tuple be sorted?
Define threaded binary tree.
