McqMate

Q. |
## Selection sort and quick sort both fall into the same category of sorting algorithms._________ is that category. |

A. | O(n log n) sorts. |

B. | Divide-and-conquer sorts. |

C. | Interchange sorts. |

D. | Average time is quadratic. |

Answer» C. Interchange sorts. |

1k

0

Do you find this helpful?

1

View all MCQs in

Data Structures (DS)No comments yet

- Sub algorithms fall into two basic categories: function sub algorithms and ____________ sub algorithms.
- Statement 1: Shell sort is a stable sorting algorithm. Statement 2: Shell sort is an in-place sorting algorithm.
- 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,
- What is the advantage of selection sort over other sorting techniques?
- The given array is arr = {3,4,5,2,1}. The number of iterations in bubble sort and selection sort respectively are,
- 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?
- Which of the following is not an advantage of optimised bubble sort over other sorting techniques in case of sorted elements?
- The time complexity of quick sort is …………..
- Quick sort uses ____ for implementation.