Which of the following is useful in implementing quick sort?
Stack
Set
List
Queue
Answers
Answer:
Set
Explanation:
The implementation of quick sort in sets is useful as a set is a nothing but a sub-array and hence a lot of procedures will be followed on it.
In stacks and queues, the data and addresses are stored in the data structure but they do not specifically need sorting as the whole point of using stacks and queues will be void. Might as well use an array or a set.
For a listen, the corresponding value for the search type is already given, hence quick sort will be best implemented in a set.
Answer:
Explanation:
Stack
Stack is que of array arranged in the particular series. They can have different methods of implementation like first in first out or first in last out.
In this the address and the memory is saved in the data structure.
With stack, we have enough temporal locality, while with queue it is lost completely. We basically are trying to sort the array in breadth first search way in queue method