首先我们选择一个中间值middle程序中我们使用数组中间值，然后 把比它小的放在左边，大的放在右边（具体的实现是从两边找，找到一对后交换）。然后对两边分别使 用这个过程（最容易的方法——递归）。 -First of all, we choose a middle value between the use of an array of programs between our values, then it is smaller than put on the left, large on the right side of (the specific implementation is to find from both sides to find a pair of post-exchange). Separately on both sides then use this process (the easiest way- recursive).