zoukankan      html  css  js  c++  java
  • 。。。快速排序。。。

    public void quickSort(int[] array, int low, int high) {
            if (low >= high) {
                return;
            }
            int left = low;
            int right = high;
            int mid = array[left];
            while (left < right) {
                while (left < right && array[right] >= mid) {
                    right--;
                }
                array[left] = array[right];
                while (left < right && array[left] <= mid) {
                    left++;
                }
                array[right] = array[left];
            }
            array[left] = mid;
            quickSort(array, low, left - 1);
            quickSort(array, left + 1, high);
        }
    

      

  • 相关阅读:
    maven
    sublime text
    ios category
    python
    activiti
    出版社
    gradle
    selenium
    spring
    Ansible状态管理
  • 原文地址:https://www.cnblogs.com/yingmeng/p/10547327.html
Copyright © 2011-2022 走看看