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
- 31884 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
Is red black tree balanced?
What is precision in data structures?
Define threaded binary tree.
Differentiate between singly and doubly linked lists?
What is the difference between hashset and hashtable?
Is arraylist better than array?
How dynamic arrays are created?
Explain Array
List the data structures which are used in network data modal.
What member function places a new node at the end of the linked list?
Define path in a graph?
Is binary tree balanced?
What are binary trees?
Write an algorithm to check if there is a loop in a doubly linked list.
What is the complexity of selection sort?
