The Sorting Problem
摘要
The sorting problem can be stated as follows. Given an array A of size n whose elements belong to a totally ordered set, permute the elements in such a way that: \(A[0]\leq A[1]\leq \cdots \leq A[n-1]\) .