Respuesta :
Bubble sort compares list items in pairs, swapping any two adjacent values that stand out of order.
What is Bubble sort?
Bubble sort, sometimes directed to as sinking sort, exists as a simple sorting algorithm that repeatedly steps through the input list component by the element, comparing the current element with the one after it, swapping their values if required. In computer graphics, bubble sort exists popular for its capacity to detect a very small error (like a swap of just two elements) in almost-sorted arrays and fix it with just linear complexity (2n).
Bubble sort exists as a simple sorting algorithm. This sorting algorithm stands comparison-based algorithm in which each pair of adjacent elements exists compared and the elements are swapped if they are not in order. In bubble sort, with every pass, the largest element bubbles up to the end of the list if the array exists sorted in ascending order. Similarly for the list to be sorted in descending order, the least element will be in its appropriate place at the end of every pass.
Hence, Bubble sort compares list items in pairs, swapping any two adjacent values that stand out of order
To learn more about Bubble sort refer to:
https://brainly.com/question/23035820
#SPJ4
