PDF Results for "Stable Sorting"

Sorting Algorithms — Stability. Let A be an array, and let < be a strict weak ordering on the elements of A. A sorting algorithm is stable if i < j and A[i] ∼ A[j] ...