/**
     * 冒泡排序 (一維數(shù)組)(二維數(shù)組某個健排序)
     * 兩兩比較待排序數(shù)據(jù)元素的大小,發(fā)現(xiàn)兩個數(shù)據(jù)元素的次序相反時即進(jìn)行交換,直到?jīng)]有反序的數(shù)據(jù)元素為止
     * 設(shè)想被排序的數(shù)組R[1..N] 垂直豎立,將每個數(shù)據(jù)元素看作有重量的氣泡,從下往上掃描數(shù)組,凡掃描違反原則的輕氣泡,就使其向上"漂浮".如此反復(fù)進(jìn)行.
     * 直到最后任何兩個氣都是輕者在上,重者在下為止.
 */
function bubble_sort($array,$key=null) {
        $count = count($array);
        if($count < 0) {
            return false;
        }
        for($i = 0; $i < $count; $i++) {
            for($j = $count - 1; $j > $i; $j--) {
                if($key && isset($array[$key])){//二維數(shù)組健存在
                    if($array[$j][$key] < $array[$j - 1][$key]) {
                        $tmp = $array[$j];
                        $array[$j] = $array[$j - 1];
                        $array[$j - 1] = $tmp;
                    }
                }else{ //一維數(shù)組
                    if($array[$j] < $array[$j - 1]) {
                        $tmp = $array[$j];
                        $array[$j] = $array[$j - 1];
                        $array[$j - 1] = $tmp;
                    }
                }
            }
        }
        return $array;
}

$data[] = array('volume' => 67, 'edition' => 2);
$data[] = array('volume' => 86, 'edition' => 1);
$data[] = array('volume' => 85, 'edition' => 6);
$data[] = array('volume' => 98, 'edition' => 2);
$data[] = array('volume' => 86, 'edition' => 6);
$data[] = array('volume' => 67, 'edition' => 7);
 
// 取得列的列表
foreach ($data as $key => $row) {
    $volume[$key]  = $row['volume'];
    $edition[$key] = $row['edition'];
}
 
// 將數(shù)據(jù)根據(jù) volume 降序排列，根據(jù) edition 升序排列
// 把 $data 作為最后一個參數(shù)，以通用鍵排序
array_multisort($volume, SORT_DESC, $edition, SORT_ASC, $data);
print_r($data);

Array
(
    [0] => Array
        (
            [volume] => 98
            [edition] => 2
        )
    [1] => Array
        (
            [volume] => 86
            [edition] => 1
        )
    [2] => Array
        (
            [volume] => 86
            [edition] => 6
         
    [3] => Array
        (
            [volume] => 85
            [edition] => 6
        )
    [4] => Array
        (
            [volume] => 67
            [edition] => 2
        )
    [5] => Array
        (
            [volume] => 67
            [edition] => 7
        )
)