Comparison-based sorting is a method of arranging elements in a specific order by comparing pairs of items. This technique relies on a comparison operator, such as less than or greater than, to determine the relative order of elements. Common algorithms that use this approach include Quick Sort, Merge Sort, and Bubble Sort. These algorithms can sort various data types, including numbers and strings, and typically have a time complexity ranging from O(n log n) to O(n²). The efficiency of comparison-based sorting makes it a fundamental concept in computer science and programming.