McqMate
Login
Register
Home
Search
Login
Register
Computer Science Engineering (CSE)
Data Structures (DS)
Searching, Sorting and Hashing Technique...
What is the average case complexity of b...
Q.
What is the average case complexity of bubble sort?
A.
O(nlogn)
B.
O(logn)
C.
O(n)
D.
O(n2)
Answer» D. O(n2)
View all MCQs in:
Data Structures (DS)
Discussion
Comment
Related Questions
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 worst case complexity of bubble sort?
The complexity of Bubble sort algorithm is _________.
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 average case complexity of selection sort?
Which of the following is not an advantage of optimised bubble sort over other sorting techniques in case of sorted elements?
Login to Continue
It will take less than 2 minutes
Continue with Google
Continue with Linkedin
Continue with Twitter
Report MCQ
Remark*
Report