2019年6月2日
10-排序6 Sort with Swap(0, i) (25 分)
摘要： Given any permutation of the numbers {0, 1, 2,..., N−1}, it is easy to sort them in increasing order. But what if Swap(0, *) is the ONLY operation tha 阅读全文
posted @ 2019-06-02 09:45 Acoccus 阅读(182) 评论(0) 推荐(1)