Sorting — Chapter Summary

Sorting means arranging elements in

Sorting means arranging elements in a required order such as ascending, descending, alphabetical, or length-based order.

Every iteration through each element

Every iteration through each element of a list in an algorithm is called a pass.

Bubble sort repeatedly compares adjacent elements

Bubble sort repeatedly compares adjacent elements and swaps them if they are unordered. For a list with n elements, it makes n - 1 passes. After each

Selection sort divides the list into

Selection sort divides the list into a sorted left part and an unsorted right part. In each pass, it finds the smallest element in the unsorted part a

Insertion sort divides the list into

Insertion sort divides the list into sorted and unsorted parts. Each unsorted element is inserted into its correct position in the sorted part by scan