Repeatedly swaps adjacent elements if they are in the wrong order.

Builds the sorted list incrementally by inserting elements in their correct order.

Efficiently finds the first occurence of a target element in a sorted array by repeatedly halving the search space.

Sequentially scans the list to locate a target element.

Divides the list into halves, sorts them, and then merges them back together.

Divides the list into halves, sorts them, and then merges them back together.

A data structure that stores elements in a first-in-first-out manner.

Efficiently finds the last occurence of a target element in a sorted array by repeatedly halving the search space.

Selects the smallest unsorted element and places it at the beginning.

A data structure that stores elements in a last-in-first-out manner.