在PHP中自帶了大量的數(shù)組排序函數(shù).
| 函數(shù)名 | 函數(shù)意義 |
| --------- |:-------------- : | ------- :|
|sort()函數(shù) | 對(duì)數(shù)組單元從低到高進(jìn)行排 序,如果有鍵名會(huì)改變鍵名 |
|rsort()函數(shù) | 對(duì)數(shù)組單元從高到低進(jìn)行排序, 會(huì)改變鍵名 |
| asort()函數(shù) | 對(duì)數(shù)組單元從低到高進(jìn)行排序并保持索引關(guān)系,即鍵值鍵名對(duì)應(yīng)|
|arsort() 函數(shù) |對(duì)數(shù)組單元從高到低進(jìn)行排序并保持索引關(guān)系|
|ksort() 函數(shù) | 對(duì)數(shù)組單元按照鍵名從低到高進(jìn)行排序 |
|krsort() 函數(shù) | 對(duì)數(shù)組單元按照鍵名從高到低進(jìn)行排序 |
a(association)前綴表示以鍵值關(guān)聯(lián)
k(key)前綴表示以鍵名關(guān)聯(lián)
r(reverse)前綴表示以反方向排
$arrSort = array('Ben' => '80', 'Peter' => '60', 'Joe' => '30');
foreach ($arrSort as $key => $value)
{ echo 'key = '.$key.', value = '.$value.'<br>';}
//key = Ben, value = 80//key = Peter, value = 60//key = Joe, value = 30
$arrSort這種數(shù)組為關(guān)聯(lián)數(shù)組, 有鍵名鍵值.如果鍵名為數(shù)字, 即為數(shù)字?jǐn)?shù)組.
sort()排序
sort($arrSort);
foreach ($arrSort as $key => $value)
{ echo 'key = '.$key.', value = '.$value.'<br>';}
//key = 0, value = 30
//key = 1, value = 60
//key = 2, value = 80
rsort()排序
rsort($arrSort);
foreach ($arrSort as $key => $value)
{ echo "key= ".$key.",value= ".$value."<br>";
}//key= 0,value= 80//key= 1,value= 60//key= 2,value= 30
ksort()排序
ksort($arrSort);
foreach ($arrSort as $key => $value) {
echo "key= ".$key.",value= ".$value."<br>";
}//key= Ben,value= 80//key= Joe,value= 30//key= Peter,value= 60
krsort()排序
krsort($arrSort);
foreach ($arrSort as $key => $value) {
echo "key= ".$key.",value= ".$value."<br>";
}//key= Peter,value= 60//key= Joe,value= 30//key= Ben,value= 80
asort()排序
asort($arrSort);
foreach ($arrSort as $key => $value)
{ echo "key= ".$key.",value= ".$value."<br>";
}//key= Joe,value= 30//key= Peter,value= 60//key= Ben,value= 80
arsort()排序
arsort($arrSort);
foreach ($arrSort as $key => $value) {
echo "key= ".$key.",value= ".$value."<br>";
}
//key= Ben,value= 80//key= Peter,value= 60//key= Joe,value= 30
