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
- 31762 Views
- I also Faced
- E-Mail Answers
Answer Posted / 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 |
Post New Answer View All Answers
What is sorting and its types?
Differentiate among cycle, path, and circuit?
Differentiate between an array and an arraylist.
Are linked lists considered linear or non-linear data structure?
What is time complexity of binary search?
What do you mean by articulation point?
What is the difference between hashset and hashtable?
How do you do a mergesort?
Which is better hashmap or hashtable?
What data type is array?
What is bubble sort algorithm in data structure sort and searching?
Do sets allow duplicates?
Define internal nodes?
What is a stable sorting algorithm?
How to show internal storage representation of data structure in RDBM?
