0
Stack is not a way to perform quicksort, it is a tool used to implement recursion.
Wiki User
∙ 12y ago
Add your answer:
Earn +20 pts
Write a c program to sort an unsorted stack?
A stack is implicitly sorted by hierarchical nested order. It does not make sense to sort a stack. Do you mean a list? If so, please ask the question again.
Divide-and-Conquer to sort numbers using quick sort?
Yes, that's how quick-sort works.
18 A list is ordered from smaller to largest when a sort is called Which sort would take the longest time to execute?
Quick Sort
When quick sort is preferred?
When you want to sort an array.
Why quick sort is called quick?
Although quick sort has a worst case time complexity of O(n^2), but for sorting a large amount of numbers, quick sort is very efficient because of the concept of locality of reference.
Is quick sort is an example of dynamic programming algorithm?
quick sort is a divide and conquer method , it is not dynamic programming
Which sort show the best average behaviour?
quick sort
Which sort show the best average behavior?
quick sort
When is quick sort better than selection sort?
Because the quick sort can be used for large lists but selection not. selection sort is used to find the minimum element ,but quick choose element called pivot and move all smaller nums before it & larger after it.
Why quick sort better than merge sort?
it has less complexity
Can you implement merge sort without using recursion?
Sure, recursion can always be substituted with using a stack.
Limitations of merge sort and quick sort?
Comolexity Not efficent big data
