MCQOPTIONS
Bookmark
Saved Bookmarks
→
Data Structures and Algorithms
→
Evaluation Infix Expression Not Parenthesized in Data Structures and Algorithms
→
What is the worst case complexity of selection sor..
1.
What is the worst case complexity of selection sort?
A.
O(nlogn)
B.
O(logn)
C.
O(n)
D.
O(n<sup>2</sup>)
Answer» E.
Show Answer
Discussion
No Comment Found
Post Comment
Related MCQs
What is the best case complexity of selection sort?
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 __________
What is the disadvantage of selection sort?
What is the average case complexity of selection sort?
What is the advantage of selection sort over other sorting techniques?
WHAT_IS_THE_ADVANTAGE_OF_SELECTION_SORT_OVER_OTHER_SORTING_TECHNIQUES??$
What is the worst case complexity of selection sort?
In the following scenarios, when will you use selection sort?
What is an in-place sorting algorithm?
Reply to Comment
×
Name
*
Email
*
Comment
*
Submit Reply