Comparison sorts are a class of sorting algorithms that determine the order of elements by comparing them. Common examples include Bubble Sort, Merge Sort, and Quick Sort. These algorithms work by evaluating pairs of elements and rearranging them based on their relative values. The efficiency of comparison sorts is often measured in terms of time complexity, with the best average-case performance being O(n log n). However, they can be less efficient than non-comparison sorts, such as Counting Sort or Radix Sort, especially for large datasets or specific types of data.