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
- 31393 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
Which type of memory allocation is referred for linked list?
What is a height of a tree?
Two linked lists are given, find out the sum of them without altering the linked list?
Differentiate between failfast and failsafe.
When new data are to be inserted into a data structure?
Define threaded binary tree.
What do you mean by quadratic probing?
Can a class have a constructor?
What is stack and its operations?
What will you prefer for traversing through a list of elements between singly and doubly linked lists?
What are the difference between malloc() and calloc()?
Define heap order property?
What is data algorithm?
Is radix sort stable?
What is data structure geeksforgeeks?
