McqMate
Sign In
Hamberger menu
McqMate
Sign in
Sign up
Home
Forum
Search
Ask a Question
Sign In
McqMate Copyright © 2025
→
Computer Science Engineering (CSE)
→
Data Structures (DS)
→
The total number of comparisons in a bub...
Q.
The total number of comparisons in a bubble sort is ….
A.
O(n logn)
B.
O(2n)
C.
O(n2)
D.
O(n)
Answer» A. O(n logn)
2k
0
Do you find this helpful?
22
View all MCQs in
Data Structures (DS)
Discussion
No comments yet
Login to comment
Related MCQs
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,
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 complexity of bubble sort?
What is the average case complexity of bubble sort?
Which of the following is not an advantage of optimised bubble sort over other sorting techniques in case of sorted elements?
What is the best case efficiency of bubble sort in the improvised version?