Sorting

Finds the smallest element in each pass, Divides list into sorted and unsorted parts, Requires n-1 passes for n elements

Selection sort finds the minimum element in each pass, maintains sorted and unsorted portions, and needs n-1 passes. It doesn't only compare adjacent elements like bubble sort.

Bubble Sort, Selection Sort

All three sorting algorithms use swapping. Bubble sort swaps adjacent elements, selection sort swaps minimum with first unsorted element, and insertion sort shifts elements to make space.

Because large elements 'bubble up' to their correct position

It's called bubble sort because the largest elements gradually 'bubble up' to the end of the list in each pass, similar to air bubbles rising to the surface in water.

Quadratic time

Algorithms with nested loops have quadratic time complexity because the inner loop runs n times for each of the n iterations of the outer loop, giving n² operations.