Bubble sort

Selection sort

Merge Sort

Insertion sort

Bubble sort

Selection sort

Merge Sort

Insertion sort

Measures the number of elementary operations performed to sort a data set.

Measures the difficulty of coding an algorithm by minimizing the number of lines of code

Measures the number of comparisons contained in an algorithm.

Measures the amount of space occupied by an algorithm.

Bubble sort

Selection sort

Merge Sort

Insertion sort

Bubble sort

Selection sort

Quick sort

Insertion sort

Adjacent elements are compared and swapped if necessary to place the smallest element at the end of the list.

Adjacent elements are compared and swapped if necessary to place the largest element at the end of the list.

Non-adjacent elements are compared and swapped if necessary to place the smallest element in its correct position.

Non-adjacent elements are compared and swapped if necessary to place the largest element in its correct position.

Bubble sort

Selection sort

Merge Sort

Insertion sort

Places the smallest element in its correct position in each iteration

Places the largest element in its correct position in each iteration.

Places a random element in its correct position in each iteration.