- Computer Science Engineering (CSE)
- Data Structures (DS)
- Searching, Sorting and Hashing Technique...
- The given array is arr = {1,2,4,3}. Bubb...

Q. |
## 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? |

A. | 4 |

B. | 2 |

C. | 1 |

D. | 0 |

Answer» B. 2 |

View all MCQs in:
Data Structures (DS)

- 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,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 = {3,4,5,2,1}. The number of iterations in bubble sort and selection sort respectively are,
- Given an array arr = {45,77,89,90,94,99,100} and key = 100; What are the mid values(corresponding array elements) generated in the first and second iterations?
- What is the best case efficiency of bubble sort in the improvised version?
- Given an array arr = {5,6,77,88,99} and key = 88; How many iterations are done until the element is found?
- Given an array arr = {45,77,89,90,94,99,100} and key = 99; what are the mid values(corresponding array elements) in the first and second levels of recursion?
- 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 ?
- What is the worst-case time for heap sort to sort an array of n elements?

Login to Continue

It will take less than 2 minutes

Report MCQ