- Computer Science Engineering (CSE)
- Data Structures (DS)
- Searching, Sorting and Hashing Technique...
- Which of the following is not an advanta...

Q. |
## Which of the following is not an advantage of optimised bubble sort over other sorting techniques in case of sorted elements? |

A. | It is faster |

B. | Consumes less memory |

C. | Detects whether the input is already sorted |

D. | Consumes less time |

Answer» C. Detects whether the input is already sorted |

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?
- What is the advantage of selection sort over other sorting techniques?
- Statement 1: Shell sort is a stable sorting algorithm. Statement 2: Shell sort is an in-place sorting algorithm.
- The given array is arr = {3,4,5,2,1}. The number of iterations in bubble sort and selection sort respectively are,
- The number of interchanges required to sort 5, 1, 6, 2 4 in ascending order using Bubble Sort is ____________.
- The number of swapping needed to sort numbers 8,22,7,9,31,19,5,13 in ascending order using bubble sort is ?
- Selection sort and quick sort both fall into the same category of sorting algorithms._________ is that category.
- An array that is first 7-sorted, then 5-sorted becomes

Login to Continue

It will take less than 2 minutes

Report MCQ