A stable sort is an algorithm that maintains the relative order of records with equal keys, ensuring that equivalent elements remain in the same sequence as they appeared in the input. This property is crucial in scenarios where subsequent operations or sorts rely on the order of these elements for correctness or efficiency.