- Computer Science Engineering (CSE)
- Data Structures (DS)
- Searching, Sorting and Hashing Technique...
- What is the disadvantage of selection so...

Q. |
## What is the disadvantage of selection sort? |

A. | It requires auxiliary memory |

B. | It is not scalable |

C. | It can be used for small keys8 |

D. | It takes linear time to sort the elements |

Answer» B. It is not scalable |

View all MCQs in:
Data Structures (DS)

- 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,
- 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 = {3,4,5,2,1}. The number of iterations in bubble sort and selection sort respectively are,
- Selection sort and quick sort both fall into the same category of sorting algorithms._________ is that category.
- Statement 1: Shell sort is a stable sorting algorithm. Statement 2: Shell sort is an in-place sorting algorithm.
- LSD radix sort requires passes to sort N elements.
- The number of interchanges required to sort 5, 1, 6, 2 4 in ascending order using Bubble Sort is ____________.
- What is the worst-case time for heap sort to sort an array of n elements?
- The number of swapping needed to sort numbers 8,22,7,9,31,19,5,13 in ascending order using bubble sort is ?

Login to Continue

It will take less than 2 minutes

Report MCQ