COMPUTER SCIENCE AND ENGINEERING
ALGORITHMS
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
Which is the first available comparison from the following, 43, 44, 45, 42, 50?
|
|
42, 44, 45, 43, 50
|
|
|
43, 44, 42, 45, 50
|
|
|
Either A or B
|
|
|
None of the above
|
Explanation:
Detailed explanation-1: -In other words, Selection Sort first finds the largest key in an unsorted list, then the next largest, and so on.
Detailed explanation-2: -Insertion sort, Bubble sort and Selection sort are comparison based sorting algorithms.
Detailed explanation-3: -The winner is Sleep Sort, which uses no comparisons.
Detailed explanation-4: -A comparison sort is a type of sorting algorithm that only reads the list elements through a single abstract comparison operation (often a “less than or equal to” operator or a three-way comparison) that determines which of two elements should occur first in the final sorted list.
There is 1 question to complete.