Answer & ExplanationAnswer: Option [B]
In selection sort, we identify the smallest value from the unsorted array and swap it with the value in the unsorted array at the starting point. In case of tightest upper bound maximum time needed and in case of lower bound minimum time needed to sort an unsorted array.
The number of iterations needed to sort an unsorted array in selection sort is equal to the numbers in that array.
i.e. in Big O-notation if n numbers in a unsorted array then n O(1) iterations needed to sort this array.
ADRE 2.0 Mock Test - 5 | Start Test |
ADRE 2.0 Mock Test - 5 | Start Test |
Government Schemes Mock Test | Start Test! |
Political Science Mock Test – 42 | Start Test |
History Test – 190 | Start Test |
Quantitative Aptitude Test | Start Test! |
Trigonometry - Mock Test | Start Test! |
Data Interpretation - Mock Test | Start Test! |
General Awareness - Mock Test | Start Test! |
Reasoning Ability - Mock Test | Start Test! |
Englist(Antonyms) Mock Test 1 | Start Test! |
Quantitative Aptitude (Percentage) Mock Test | Start Test! |
Economy Mock Test 1 | Unlock Test! |
Books & Authors - Test 2 | Unlock Test! |