COMPUTER SCIENCE AND ENGINEERING
ALGORITHMS
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
Merge
|
|
|
Bubble
|
|
|
Insertion
|
|
|
None of these
|
Detailed explanation-1: -Bubble sort is a simple sorting algorithm that repeatedly steps through the list to be sorted, compares each pair of adjacent items and swaps them if they are in the wrong order. The pass through the list is repeated until no swaps are needed, which indicates that the list is sorted.
Detailed explanation-2: -Bubble Sort is the simplest sorting algorithm that works by repeatedly swapping the adjacent elements if they are in the wrong order.
Detailed explanation-3: -Bubble sort algorithm, also known as sinking sort, is the simplest sorting algorithm that runs through the list repeatedly, compares adjacent elements, and swaps them if they are out of order.
Detailed explanation-4: -This algorithm is called selection sort because it repeatedly selects the next-smallest element and swaps it into place.
Detailed explanation-5: -The selection sort improves on the bubble sort by making only one exchange for every pass through the list.