The document discusses two sorting algorithms: selection sort and quicksort. Selection sort works by iterating through the list and selecting the minimum element to swap into the sorted portion of the list. Quicksort works by selecting a pivot element and partitioning the list into elements less than and greater than the pivot, then recursively sorting each sub-list. The document provides step-by-step examples of how each algorithm sorts a sample list of numbers in ascending order.