SSC
COMPUTER
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
You have a list of students in alphabetical order, which algorithm would be best to find a specific student?
|
|
bubble
|
|
|
Linear
|
|
|
Quick
|
|
|
Binary
|
Explanation:
Detailed explanation-1: -The time complexity of Quicksort is O(n log n) in the best case, O(n log n) in the average case, and O(n^2) in the worst case. But because it has the best performance in the average case for most inputs, Quicksort is generally considered the “fastest” sorting algorithm.
There is 1 question to complete.