General comparison sorts are algorithms that arrange a list of items by comparing them to one another. These sorts work by evaluating pairs of elements and determining their order based on a defined relationship, such as less than or greater than. Common examples include Quick Sort, Merge Sort, and Bubble Sort. These sorting methods can be applied to various data types, including numbers and strings. The efficiency of comparison sorts often depends on the number of comparisons made, which can vary based on the algorithm used and the initial arrangement of the data.