Which of following data structure is more appropriate for implementing quick sort iteratively?a.Dequeb.Queuec.Stackd.Priority queue

The most appropriate data structure for implementing quick sort iteratively is c. Stack.

Here's why:

1. Quick sort is a divide and conquer algorithm which works by selecting a 'pivot' element from the array and partitioning the other elements into two sub-arrays, according to whether they are less than or greater than the pivot.

2. The sub-arrays are then recursively sorted. This recursive nature of quick sort can be simulated using a stack data structure.

3. In the iterative version of quick sort, we explicitly create a stack and start by pushing the largest possible range on to the stack.

4. The top element of stack is popped and the range is partitioned. If there are elements on either side of the partition, then the ranges are pushed onto the stack.

5. This process is continued until the stack is empty.

Hence, a stack is more appropriate for implementing quick sort iteratively.