McqMate

Q. |
## Which of following data structure is more appropriate for implementing quick sort iteratively? |

A. | Deque |

B. | Queue |

C. | Stack |

D. | Priority queue |

Answer» C. Stack |

3.7k

0

Do you find this helpful?

30

View all MCQs in

Data Structures (DS)No comments yet

- Consider the following statements:i. First-in-first out types of computations are efficiently supported by STACKS. ii. Implementing LISTS on linked lists is more efficient than implementing LISTS on an array for almost all the basic LIST operations. iii. Implementing QUEUES on a circular array is more efficient than implementing QUEUES on a linear array with two indices. iv. Last-in-first-out type of computations are efficiently supported by QUEUES.Which of the following is correct?
- Selection sort and quick sort both fall into the same category of sorting algorithms._________ is that category.
- The given array is arr = {1, 2, 4, 3}. Bubble sort is used to sort the array elements. How many iterations will be done to sort the array?
- The given array is arr = {1,2,4,3}. Bubble sort is used to sort the array elements. How many iterations will be done to sort the array with improvised version?
- The given array is arr = {1,2,3,4,5}. (bubble sort is implemented with a flag variable)The number of iterations in selection sort and bubble sort respectively are,
- Which data structure is used for implementing recursion?
- The time complexity of quick sort is …………..
- Quick sort uses ____ for implementation.
- Who invented Quick sort procedure?
- Quick sort is also known as ……..