Comparison Sort refers to 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 Sort algorithms is often measured in terms of time complexity, with the best average-case performance being O(n log n). However, they are limited by the Comparison Sort Lower Bound, which states that no comparison-based sorting algorithm can perform better than this in the average case.