简单的c++排序算法一：高级排序算法它的工作看起来仍然象一个二叉树。首先我们选择一个中间值middle程序中我们使用数组中间值，然后把比它小的放在左边，大的放在右边（具体的实现是从两边找，找到一对后交换）。然后对两边分别使用这个过程（最容易的方法——递归）。-Simple c++ sorting algorithm: Advanced sorting algorithm it still looks like a binary tree. First, we chose an intermediate value middle program, we use an array of intermediate values, and then on the left than it big on the right (concrete realization from both sides to find to find a pair exchanged). Then on both sides of this process (the easiest way- recursive).