What are three common sort algorithms?

The three common sort algorithms identified in the choice are bubble sort, selection sort, and insertion sort. These algorithms are foundational in computer science and provide a good introduction to sorting techniques.

Bubble sort is one of the simplest sorting algorithms. It works by repeatedly stepping through the list to be sorted, comparing adjacent elements, and swapping them if they are in the wrong order. This process is repeated until the list is sorted. Its simplicity makes it a useful tool for educational purposes, although it is not efficient for large datasets.

Selection sort improves on the bubble sort by dividing the input list into a sorted and an unsorted region. It repeatedly selects the smallest (or largest, depending on sorting order) element from the unsorted region and moves it to the end of the sorted region. While it is also not the most efficient for large datasets, it has a more straightforward approach to its sorting process.

Insertion sort builds the sorted array one element at a time by repeatedly taking one element from the unsorted portion and inserting it into the correct position in the sorted portion. This algorithm is efficient for small datasets or partially sorted lists and is intuitive and easy to implement.

The other options present sorting algorithms that are either less common in introductory contexts or are more advanced than the