php实用快速排序算法的实例代码

<?php
/**
 * PHP插入排序的类
 * @site www.jb200.com
 */
class insert_sort {
  public $arr;
  public $size;
 
  function __construct($arr) {
    $this->arr = $arr;
    $this->size = count ( $arr );
  }
 
  //引用传递，实现数据值的交换
  function swap(&$a, &$b) {
    list ( $a, $b ) = array ($b, $a );
  }
 
  //插入排序主逻辑函数
  function insert_sort_process() {
    for($j = 1; $j < $this->size; $j ++) {
      $key = $this->arr [$j];
      $i = $j - 1;
      while ( $i >= 0 && $this->arr [$i] > $key ) {
        $this->swap ( $this->arr [$i], $this->arr [$i + 1] );
        $i --;
      }
      //$i+1是因为退出while循环时进行了减一操作
      $this->arr [$i + 1] = $key;
    }
    return $this->arr;
  }
}

<?php
/**
 * php实现快速排序类
 * @site www.jb200.com       
 */
class quick_sort {
  public $arr;
  public $size;
 
  function __construct($array) {
    $this->arr = $array;
    $this->size = count ( $array );
  }
 
  function quick_swap(&$a, &$b) {
    list ( $a, $b ) = array ($b, $a );
  }
 
  //获取分段数据位置
  function quick_partiton($left, $right) {
    $key = $this->arr [$left];
    $i = $left + 1;
    $j = $right;
    while ( $i <= $j ) {
      while ( $i <= $j && $this->arr [$i] <= $key ) {
        $i ++;
      }
      while ( $i <= $j && $this->arr [$j] > $key ) {
        $j --;
      }
      if ($i < $j) {
        $this->quick_swap ( $this->arr [$i], $this->arr [$j] );
      }
    }
    $this->quick_swap ( $this->arr [$left], $this->arr [$j] );
    return $j;
  }
 
  //快速排序主逻辑函数
  function quick_sort_process($left = null, $right = null) {
    $left = (is_null ( $left )) ? 0 : $left;
    $right = (is_null ( $right )) ? $this->size - 1 : $right;
    if ($left < $right) {
      $middle = $this->quick_partiton ( $left, $right );
      $this->quick_sort_process ( $left, $middle - 1 );
      $this->quick_sort_process ( $middle + 1, $right );
    }
  }
}