Elementary sorts are basic algorithms used to arrange a list of items in a specific order, typically ascending or descending. Common examples include Bubble Sort, Selection Sort, and Insertion Sort. These algorithms are straightforward and easy to implement, making them ideal for educational purposes and small datasets. Each elementary sort operates by comparing and rearranging elements in the list. For instance, Bubble Sort repeatedly steps through the list, swapping adjacent elements if they are in the wrong order. While these sorts are simple, they are not the most efficient for large datasets, as their time complexity can be relatively high compared to more advanced sorting algorithms.