McqMate
Sign In
Hamberger menu
McqMate
Sign in
Sign up
Home
Forum
Search
Ask a Question
Sign In
McqMate Copyright © 2024
→
Computer Science Engineering (CSE)
→
Data Structures (DS)
→
Searching, Sorting and Hashing Technique...
→
What is the best case complexity of sele...
Q.
What is the best case complexity of selection sort?
A.
O(nlogn)
B.
O(logn)
C.
O(n)
D.
O(n2)
Answer» D. O(n2)
2.3k
0
Do you find this helpful?
11
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,
What is the worst case complexity of selection sort?
What is the average case complexity of selection sort?
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.
What is the worst case complexity of bubble sort?
What is the average case complexity of bubble sort?
What is the worst case time complexity of LSD radix sort?
