midterms 2

Bubble sort's big O time complexity is __.

O(n^2)

In a stable sort, when two elements have the same value, __.

their relative positions are maintained.

The method of sorting that involves checking if the list is already sorted and stopping if it is is called __.

adaptability.

The space complexity for bubble sort is __.

O(1)

Bubble sort is considered __ because it can be modified to check for swaps after each iteration.

adaptable.

The type of sort where the largest or smallest element is swapped with the last unsorted element in each iteration is called __.

selection sort.

Bogo sort is considered a bad sorting algorithm because it relies on __.

randomly shuffling the list and checking if it's sorted.

The __ algorithm is faster and more efficient compared to a linear search.

binary search.

The process of moving elements to their proper positions in sorting is often described as __.

bubbling.

In terms of sorting algorithms, __ refers to how well the algorithm maintains the original order of equal elements after sorting.

stability.