数组 函数
在线手册:中文 英文
PHP手册

usort

(PHP 4, PHP 5)

usort 使用用户自定义的比较函数对数组中的值进行排序

说明

bool usort ( array &$array , callback $cmp_function )

本函数将用用户自定义的比较函数对一个数组中的值进行排序。如果要排序的数组需要用一种不寻常的标准进行排序,那么应该使用此函数。

比较函数必须在第一个参数被认为小于,等于或大于第二个参数时分别返回一个小于,等于或大于零的整数。

Note:

如果两个成员比较结果相同,则它们在排序后的数组中的顺序未经定义。到 PHP 4.0.6 之前,用户自定义函数将保留这些单元的原有顺序。但是由于在 4.1.0 中引进了新的排序算法,结果将不是这样了,因为对此没有一个有效的解决方案。

Note: 此函数为 array 中的元素赋与新的键名。这将删除原有的键名,而不是仅仅将键名重新排序。

成功时返回 TRUE, 或者在失败时返回 FALSE.

Example #1 usort() 例子

<?php
function cmp($a$b)
{
    if (
$a == $b) {
        return 
0;
    }
    return (
$a $b) ? -1;
}

$a = array(32561);

usort($a"cmp");

foreach (
$a as $key => $value) {
    echo 
"$key$value\n";
}
?>

以上例程会输出:

0: 1
1: 2
2: 3
3: 5
4: 6

Note:

很明显在这个小例子中用 sort() 函数更合适。

Example #2 使用多维数组的 usort() 例子

<?php
function cmp($a$b)
{
    return 
strcmp($a["fruit"], $b["fruit"]);
}

$fruits[0]["fruit"] = "lemons";
$fruits[1]["fruit"] = "apples";
$fruits[2]["fruit"] = "grapes";

usort($fruits"cmp");

while (list(
$key$value) = each($fruits)) {
    echo 
"\$fruits[$key]: " $value["fruit"] . "\n";
}
?>

当排序多维数组时,$a$b 包含到数组第一个索引的引用。

以上例程会输出:

$fruits[0]: apples
$fruits[1]: grapes
$fruits[2]: lemons

Example #3 使用对象的成员函数的 usort() 例子

<?php
class TestObj {
    var 
$name;

    function 
TestObj($name)
    {
        
$this->name $name;
    }

    
/* This is the static comparing function: */
    
function cmp_obj($a$b)
    {
        
$al strtolower($a->name);
        
$bl strtolower($b->name);
        if (
$al == $bl) {
            return 
0;
        }
        return (
$al $bl) ? +: -1;
    }
}

$a[] = new TestObj("c");
$a[] = new TestObj("b");
$a[] = new TestObj("d");

usort($a, array("TestObj""cmp_obj"));

foreach (
$a as $item) {
    echo 
$item->name "\n";
}
?>

以上例程会输出:

b
c
d

参见 uasort()uksort()sort()asort()arsort()ksort()natsort()rsort()

参数

array

The input array.

cmp_function

在第一个参数小于,等于或大于第二个参数时,该比较函数必须返回一个小于,等于或大于0的整数

int callback ( mixed $a, mixed $b )

返回值

成功时返回 TRUE, 或者在失败时返回 FALSE.

更新日志

版本 说明
4.1.0 A new sort algorithm was introduced. The cmp_function doesn't keep the original order for elements comparing as equal.

范例

Example #4 usort() example

<?php
function cmp($a$b)
{
    if (
$a == $b) {
        return 
0;
    }
    return (
$a $b) ? -1;
}

$a = array(32561);

usort($a"cmp");

foreach (
$a as $key => $value) {
    echo 
"$key$value\n";
}
?>

以上例程会输出:

0: 1
1: 2
2: 3
3: 5
4: 6

Note:

Obviously in this trivial case the sort() function would be more appropriate.

Example #5 usort() example using multi-dimensional array

<?php
function cmp($a$b)
{
    return 
strcmp($a["fruit"], $b["fruit"]);
}

$fruits[0]["fruit"] = "lemons";
$fruits[1]["fruit"] = "apples";
$fruits[2]["fruit"] = "grapes";

usort($fruits"cmp");

while (list(
$key$value) = each($fruits)) {
    echo 
"$fruits[$key]: " $value["fruit"] . "\n";
}
?>

When sorting a multi-dimensional array, $a and $b contain references to the first index of the array.

以上例程会输出:

$fruits[0]: apples
$fruits[1]: grapes
$fruits[2]: lemons

Example #6 usort() example using a member function of an object

<?php
class TestObj {
    var 
$name;

    function 
TestObj($name)
    {
        
$this->name $name;
    }

    
/* This is the static comparing function: */
    
static function cmp_obj($a$b)
    {
        
$al strtolower($a->name);
        
$bl strtolower($b->name);
        if (
$al == $bl) {
            return 
0;
        }
        return (
$al $bl) ? +: -1;
    }
}

$a[] = new TestObj("c");
$a[] = new TestObj("b");
$a[] = new TestObj("d");

usort($a, array("TestObj""cmp_obj"));

foreach (
$a as $item) {
    echo 
$item->name "\n";
}
?>

以上例程会输出:

b
c
d

参见


数组 函数
在线手册:中文 英文
PHP手册
PHP手册 - N: 使用用户自定义的比较函数对数组中的值进行排序

用户评论:

zuallauz at gmail dot com (30-Mar-2012 05:56)

When trying to do some custom sorting with objects and an anonymous function it wasn't entirely clear how this usort function works. I think it probably uses a quicksort in the background. Basically it actually moves the $b variable up or down in respect to the $a variable. It does NOT move the $a variable inside the callback function. This is key to getting your logic right in the comparisons.

If you return -1 that moves the $b variable down the array, return 1 moves $b up the array and return 0 keeps $b in the same place.

To test I cut down my code to sorting a simple array from highest priority to lowest.

<?php
$priorities
= array(5, 8, 3, 7, 3);

usort($priorities, function($a, $b)
{
    if (
$a == $b)
    {
        echo
"a ($a) is same priority as b ($b), keeping the same\n";
        return
0;
    }
    else if (
$a > $b)
    {
        echo
"a ($a) is higher priority than b ($b), moving b down array\n";
        return -
1;
    }
    else {
        echo
"b ($b) is higher priority than a ($a), moving b up array\n";               
        return
1;
    }
});

echo
"Sorted priorities:\n";
var_dump($priorities);
?>

Output:

b (8) is higher priority than a (3), moving b up array
b (5) is higher priority than a (3), moving b up array
b (7) is higher priority than a (3), moving b up array
a (3) is same priority as b (3), keeping the same
a (8) is higher priority than b (3), moving b down array
b (8) is higher priority than a (7), moving b up array
b (8) is higher priority than a (5), moving b up array
b (8) is higher priority than a (3), moving b up array
a (5) is higher priority than b (3), moving b down array
a (7) is higher priority than b (5), moving b down array

Sorted priorities:
array(5) {
  [0]=> int(8)
  [1]=> int(7)
  [2]=> int(5)
  [3]=> int(3)
  [4]=> int(3)
}

andi_mclean at ntlworld dot com (04-Feb-2012 11:58)

I needed a sort method that would sort strings but take note of any numbers and would compare them as number. I also want to ignore any non alphanumerical characters.

Eg.
Slot 1 Example
Slot 10 Example
Slot 2 Example

Should infact be
Slot 1 Example
Slot 2 Example
Slot 10 Example

<?php
function sort_with_numbers($a , $b) {
   
$a = explode(' ',$a);
   
$b = explode(' ',$b);
   
$size = min(count($a), count($b));
    for(
$index =0; $index < $size; ++$index) {
       
$a1 = ereg_replace("[^A-Za-z0-9]", "",$a[$index]);
       
$b1 = ereg_replace("[^A-Za-z0-9]", "",$b[$index]);
       
$equal = 0;
        if (
is_numeric($a1) && is_numeric($b1)) {
           
$equal = $a1 - $b1;
        } else {
           
$equal = strcasecmp($a1,$b1);
        }
        if (
$equal < 0) {
            return -
1;
        }
        if (
$equal > 0) {
            return
1;
        }
    }
    return
count($a) - count($b);   
}
?>

Quicker (05-Jan-2012 09:53)

This one may approve multisort performance dramatically.

I had a 100K-row-array with assoc keys and sub arrays, several MBs. Using usort hammered my dev box cpu for several minutes until I killed it.
My own assoc-version of [someone else's code] did the same. Following Array-Indexing and sorting solution only took very few secs:

<?php
define
('funcname',0);
define('indexfieldinfuncparamspos',1);
define('funcparams',2);
function
array_index($dataarr,$field2funcarr){
 
$indexarr=array();
  foreach(
$dataarr as $key=>$valarr) {
   
$currentindex='';
    foreach(
$field2funcarr as $fieldid=>$funcarr) if(is_array($funcarr)) {
     
$funcarr[funcparams][$funcarr[indexfieldinfuncparamspos]]= $valarr[$fieldid];
     
$currentindex.= call_user_func_array($funcarr[funcname],$funcarr[funcparams]).'_';
    } else
$currentindex.= $valarr[$fieldid].'_';
   
$indexarr[$currentindex]=$key;
  }
  return
$indexarr;
}
function
array_sortbyindex(&$dataarr,$indexarr,$issortindexbykey=true){
 
// assumes complete index!: each item of indexarr must correlate a key of dataarr
 
$resultarr=array();
  if(
$issortindexbykey) ksort($indexarr);
  foreach(
$indexarr as $datakey) $resultarr[$datakey]= $dataarr[$datakey];
  return
$resultarr;
}

$dataarr=array(
'Franz'=>array('letters'=>5,'wordtype'=>'name'),
'goes'=>array('letters'=>4,'wordtype'=>'verb'),
'to'=>array('letters'=>2,'wordtype'=>'prep'),
'China'=>array('letters'=>5,'wordtype'=>'noun'));

// just build an index for interest (empty string for wordtype as no modification required):
print_r(array_index($dataarr, array('letters'=>array('str_pad',0,array('',7,'0',STR_PAD_LEFT)), 'wordtype'=>'')));

// build index and sort - all in one go:
print_r(array_sortbyindex($dataarr, array_index($dataarr, array('letters'=>array('str_pad',0, array('',7,'0',STR_PAD_LEFT)), 'wordtype'=>''))));
?>

first print_r returns:
Array
(
    [0000005_name_] => Franz
    [0000004_verb_] => goes
    [0000002_prep_] => to
    [0000005_noun_] => China
)

second print_r returns:
Array
(
    [to] => Array
        (
            [letters] => 2
            [wordtype] => prep
        )

    [goes] => Array
        (
            [letters] => 4
            [wordtype] => verb
        )

    [Franz] => Array
        (
            [letters] => 5
            [wordtype] => name
        )

    [China] => Array
        (
            [letters] => 5
            [wordtype] => noun
        )

)

Major Benefits:
- extremly fast
- each sort field can apply an own modifier. Ideally you can use out-of-the-box functions, which reduces effort for programming callbacks
- you could use the index eg. for sorted data output without physically sorting the data

admin at gosenz dot com (05-Dec-2011 04:58)

sort multi-dimentional arrays in class with usort

<?php
class ArraySort
{
    private
$arr = array();

    public function
__construct($arr)
    {
       
$this->arr = $arr;
    }

    public function
doSort()
    {
       
$cmp = function($a, $b)
        {
           
//Do Some Comparation
       
}
        if(
is_array($this->arr))
        {
           
usort($this->arr, $cmp);
        }
        return
$this->arr;
    }
}
?>

Gok6tm (13-Sep-2011 02:09)

this is a new multisort function for sorting on multiple subfield like it will be in sql : 'ORDER BY field1, field2'
number of sort field is undefined
<?php

$array
[] = array('soc' => 3, 'code'=>1);
$array[] = array('soc' => 2, 'code'=>1);
$array[] = array('soc' => 1, 'code'=>1);
$array[] = array('soc' => 1, 'code'=>1);
$array[] = array('soc' => 2, 'code'=>5);
$array[] = array('soc' => 1, 'code'=>2);
$array[] = array('soc' => 3, 'code'=>2);

//usage
print_r(multiSort($array, 'soc', 'code'));

function
multiSort() {
   
//get args of the function
   
$args = func_get_args();
   
$c = count($args);
    if (
$c < 2) {
        return
false;
    }
   
//get the array to sort
   
$array = array_splice($args, 0, 1);
   
$array = $array[0];
   
//sort with an anoymous function using args
   
usort($array, function($a, $b) use($args) {

       
$i = 0;
       
$c = count($args);
       
$cmp = 0;
        while(
$cmp == 0 && $i < $c)
        {
           
$cmp = strcmp($a[ $args[ $i ] ], $b[ $args[ $i ] ]);
           
$i++;
        }

        return
$cmp;

    });

    return
$array;

}
?>

output:
Array
(
    [0] => Array
        (
            [soc] => 1
            [code] => 1
        )

    [1] => Array
        (
            [soc] => 1
            [code] => 1
        )

    [2] => Array
        (
            [soc] => 1
            [code] => 2
        )

    [3] => Array
        (
            [soc] => 2
            [code] => 1
        )

    [4] => Array
        (
            [soc] => 2
            [code] => 5
        )

    [5] => Array
        (
            [soc] => 3
            [code] => 1
        )

    [6] => Array
        (
            [soc] => 3
            [code] => 2
        )

)

neculitairinel at yahoo dot com (19-Aug-2011 02:12)

Here is another date sort, in case you have hours and minutes in the dates.

<?php
function DateSort($a,$b,$d="-") {
    if (
$a == $b) {
        return
0;
    } else { 
       
$a = strtotime($a);
       
$b = strtotime($b);
        if(
$a<$b) {
            return -
1;
        } else {
            return
1;
        }
    }
}
?>

Lea Hayes (13-Jul-2011 01:55)

<?php
/**
 * Sort array of objects by field.
 *
 * @param array $objects Array of objects to sort.
 * @param string $on Name of field.
 * @param string $order (ASC|DESC)
 */
function sort_on_field(&$objects, $on, $order = 'ASC') {
   
$comparer = ($order === 'DESC')
        ?
"return -strcmp(\$a->{$on},\$b->{$on});"
       
: "return strcmp(\$a->{$on},\$b->{$on});";
   
usort($objects, create_function('$a,$b', $comparer));
}
?>

bcsj (28-Jun-2011 07:12)

Sorting a multidimensional array by a subkey seem to be one of the bigger challenges when using usort. At least if one want the key to be dynamic. For anyone interested this code seemed to work rather well for me:

<?php

usort
($array,array(new cmp($key), "cmp__"));

class
cmp {
    var
$key;
    function
__construct($key) {
       
$this->key = $key;
    }
   
    function
cmp__($a,$b) {
       
$key = $this->key;
        if (
$a[$key] == $b[$key]) return 0;
        return ((
$a[$key] > $b[$key]) ? 1 : -1);
    }
}

?>

masonswolf+ignorethispart at gmail dot com (13-Jun-2011 06:42)

[The second version of a function I wrote], just a little cleaner to use, since the usort call is now folded into the custom 'usortByArrayKey' function.

Seems like this is a popular problem - sorting an array of arrays by the keys of sub-arrays, so I'll go ahead and throw in an approach I haven't seen anyone mention yet. It only works since PHP 5.3 because that's when anonymous functions got added to the language.

<?php
function usortByArrayKey(&$array, $key, $asc=SORT_ASC) {
   
$sort_flags = array(SORT_ASC, SORT_DESC);
    if(!
in_array($asc, $sort_flags)) throw new InvalidArgumentException('sort flag only accepts SORT_ASC or SORT_DESC');
   
$cmp = function(array $a, array $b) use ($key, $asc, $sort_flags) {
        if(!
is_array($key)) { //just one key and sort direction
           
if(!isset($a[$key]) || !isset($b[$key])) {
                throw new
Exception('attempting to sort on non-existent keys');
            }
            if(
$a[$key] == $b[$key]) return 0;
            return (
$asc==SORT_ASC xor $a[$key] < $b[$key]) ? 1 : -1;
        } else {
//using multiple keys for sort and sub-sort
           
foreach($key as $sub_key => $sub_asc) {
               
//array can come as 'sort_key'=>SORT_ASC|SORT_DESC or just 'sort_key', so need to detect which
               
if(!in_array($sub_asc, $sort_flags)) { $sub_key = $sub_asc; $sub_asc = $asc; }
               
//just like above, except 'continue' in place of return 0
               
if(!isset($a[$sub_key]) || !isset($b[$sub_key])) {
                    throw new
Exception('attempting to sort on non-existent keys');
                }
                if(
$a[$sub_key] == $b[$sub_key]) continue;
                return (
$sub_asc==SORT_ASC xor $a[$sub_key] < $b[$sub_key]) ? 1 : -1;
            }
            return
0;
        }
    };
   
usort($array, $cmp);
};
?>

Examples:
1) Sort a multi-dimensional array by a single key, from least to greatest:
    usortByArrayKey($resultset, 'order_id');

2) Sort a multi-dimensional array by a single key, from greatest to least:
    usortByArrayKey($resultset, 'purchase_amount', SORT_DESC);

3) Sort a multi-dimensional array first by one key, but then by a different key when the first one is equal, both from least to greatest:
    usortByArrayKey($resultset, array('product_id', 'price'));

4) Sort a multi-dimensional array by two different keys from least to greatest, and then a third from greatest to least if the first two keys map to the equal values:
    usortByArrayKey($resultset, array('product_id', 'customer_id', 'date'=>SORT_DESC));

5) Sort a multi-dimensional array by multiple keys, all from greatest to least:
    usortByArrayKey($resultset, array('product_id', 'price'), SORT_DESC);

One word of caution, since SORT_ASC and SORT_DESC have actual int values of 4 and 3, respectively, if you need to sort a multi-dimensional array by keys 3 or 4, and you're using an array to pass in your keys, you MUST specify your sort flags (e.g. array(3 => SORT_ASC,...)) to prevent unexpected behavior, instead of relying on the function's second parameter as your default sort flag.

cuonghuyto at gmail dot com (02-Mar-2011 10:42)

Some contribution towards a specification of usort()

------
- If you don't provide the callback function, an error would be raised: "usort(): Invalid comparison function."
- If your callback function doesn't return anything, or returns any value other than -1 or +1 (e.g. 0, 2, -2), then usort() would treat your sorting purpose as if there is no comparison operator provided, and it would actually change your list into an undefined order
------

markfiend at gmail dot com (21-Feb-2011 10:22)

To sort a multidimensional array (such as is returned from database query) by the values in $array[foo][$key]

e.g.
<?php
/** Potential pitfall if there is already a key of '__________'
 *  in the subarrays. Not likely I hope!
 * -------------------------------------------------------------
 */
function array_sort_by_subval(&$array, $key) {
    foreach(
$array as &$v) {
       
$v['__________'] = $v[$key];
    }
   
usort($array, 'sort_by_underscores');
    foreach(
$array as &$v) {
        unset(
$v['__________']);
    }
}

function
sort_by_underscores($a, $b) {
    if(
$a['__________'] == $b['__________']) return 0;
    if(
$a['__________'] < $b['__________']) return -1;
    return
1;
}

$n = array(array('a' => 0, 'b' => 7, 'c' => 2),
           array(
'a' => 4, 'b' => 1, 'c' => 3),
           array(
'a' => 7, 'b' => 3, 'c' => 1));

array_sort_by_subval($n, 'b');
?>
The array $n will now be:
array(array('a' => 4, 'b' => 1, 'c' => 3),
      array('a' => 7, 'b' => 3, 'c' => 1),
      array('a' => 0, 'b' => 7, 'c' => 2))

cmanley_nl (24-Jan-2011 07:55)

I had to sort a result set by host. I made this comparator function to use in usort calls.
Sorts by host segment so that a.example.org comes after b.example.com, etc.

<?php
function hostcmp($a, $b) {
   
$a = strtolower($a);
   
$b = strtolower($b);
    if (
$a == $b) {
        return
0;
    }
   
$parts_a = array_reverse(explode('.', $a));
   
$parts_b = array_reverse(explode('.', $b));
   
$max = max(count($parts_a), count($parts_b));
    for (
$i=0; $i < $max; $i++) {
        if ((
$i < count($parts_a)) && ($i < count($parts_b))) {
            if (
$c = strcmp($parts_a[$i],$parts_b[$i])) {
                return
$c;
            }
        }
        else {
           
// Return numeric cmp on array sizes. PHP doesn't have a <=> operator, so emulate it.
            //return count($parts_a) <=> count($parts_b);
           
return count($parts_a) == count($parts_b) ? 0 : (count($parts_a) < count($parts_b) ? -1 : 1);
        }
    }
    return
0;
}
?>

fmaz008 at gmail dot com (29-Sep-2010 10:23)

This comment is just to help backward compatibility.

I needed to have a foreach loop using reference just before using the usort function on the same array that was used in the foreach.

Like this:
<?php
public function sortByTitle()
{
        if(empty(
$this->_arrSubCat))
            return
false;
       
        foreach(
$this->_arrSubCat as &$cat)
           
$cat->sortByTitle();
       
       
usort($this->_arrSubCat, 'strcasecmp');
}
?>

I had this strange bug where the last object of the $this->_arrSubCat array before the sort was alway replaced/overwrited with his string value.

On my machine (PHP 5.3), I had no problem, but when I placed the code on another server, my code crashed with a fatal error (Because I was using a string as an object later in the code)

The solution I found is really simple, and avoid the array to have a reference declared in memory while running the sort function. Just add an unset($cat):

<?php
public function sortByTitle()
{
        if(empty(
$this->_arrSubCat))
            return
false;
       
        foreach(
$this->_arrSubCat as &$cat)
           
$cat->sortByTitle();
       
        unset(
$cat); //No more problem because of the foreach &cat reference.   
       
usort($this->_arrSubCat, 'strcasecmp');
}
?>

It took me an hour an a half to locate the bug, hope it will save someone some time !

phil at lavin dot me dot uk (01-Aug-2010 07:06)

strcmp (or strcasecmp) can be used as a callback function for usort. It will cast your comparison values to string. Thus, you can implement a __toString() method into your classes and use usort without creating a callback function:

<?php
class Foo {
   private
$a;
   private
$b;

   public function
__construct($a, $b) {
     
$this->a = $a;
     
$this->b = $b;
   }

   public function
__toString() {
      return (string)
$this->a;
   }
}

$foo = array(new Foo('t', 'b'), new Foo('a', 'c'), new Foo('g', 'd'));

print_r($foo);

usort($foo, 'strcasecmp');

print_r($foo);
?>

xaguilars at gmail dot com (06-May-2010 12:03)

I'd like to share with the community my function for sorting an array of arrays or objects containing associative data. This could be used, for example, with a MySQL result.

<?php
function sort_by($field, &$arr, $sorting=SORT_ASC, $case_insensitive=true){
    if(
is_array($arr) && (count($arr)>0) && ( ( is_array($arr[0]) && isset($arr[0][$field]) ) || ( is_object($arr[0]) && isset($arr[0]->$field) ) ) ){
        if(
$case_insensitive==true) $strcmp_fn = "strnatcasecmp";
        else
$strcmp_fn = "strnatcmp";

        if(
$sorting==SORT_ASC){
           
$fn = create_function('$a,$b', '
                if(is_object($a) && is_object($b)){
                    return '
.$strcmp_fn.'($a->'.$field.', $b->'.$field.');
                }else if(is_array($a) && is_array($b)){
                    return '
.$strcmp_fn.'($a["'.$field.'"], $b["'.$field.'"]);
                }else return 0;
            '
);
        }else{
           
$fn = create_function('$a,$b', '
                if(is_object($a) && is_object($b)){
                    return '
.$strcmp_fn.'($b->'.$field.', $a->'.$field.');
                }else if(is_array($a) && is_array($b)){
                    return '
.$strcmp_fn.'($b["'.$field.'"], $a["'.$field.'"]);
                }else return 0;
            '
);
        }
       
usort($arr, $fn);
        return
true;
    }else{
        return
false;
    }
}
?>

Alex Rath (17-Apr-2010 07:35)

This is the perfect Place for anonymous Functions, here an Example:

<?php

  $array
= array(3, 2, 5, 6, 1);

 
usort($array, function($func_a, $func_b) {
    if(
$func_a == $func_b) return 0;
    return (
$func_a < $func_b) ? -1 : 1;
  });

  foreach (
$array as $key => $value) echo "$key: $value\n";

?>

nicolas dot demarque at gmail dot com (10-Apr-2010 07:37)

Another way to compare object is to have a compare static function in the class with reccursion ability and have globals or static variables who save the state of comparison, and the order.

It could be a good idea to have a variable with comparison functions name (with the sorting : numeric, alphanumeric, inverse).

<?php
interface Comparable{static function compare($a, $b);}
class
myObj implements Comparable{
        var
$var1; var $var2; var $var3;
        function
__construct($v1, $v2, $v3){
               
$this->var1=$v1; $this->var2=$v2; $this->var3=$v3;
        }
        public function
__toString() {
                return
"v1 ".$this->var1." v2 ".$this->var2." v3 ".$this->var3;
        }
        static function
compare($a, $b){
               
$sort=$GLOBALS['sorts'][$GLOBALS['sort']];
                echo
"$sort\n";
                if(
$a->$sort == $b->$sort){
                        if(
$GLOBALS['sorts'][$GLOBALS['sort']+1]){
                               
$GLOBALS['sort']++;
                               
$rescall_user_func(array('myObj', 'compare'), $a, $b);
                               
$GLOBALS['sort']=0; return $res;
                        }
                       
$GLOBALS['sort']=0; return 0;
                }
               
$GLOBALS['sort']=0;
                if(
$a->$sort > $b->$sort)
                        return
1;
                return -
1;
        }
}

$objects = array(new myObj("1", "2", "3"), new myObj("2", "2", "2"), new myObj("1", "3", "4"));

/* Tests */
$sorts=Array('var1', 'var2', 'var3'); $sort = 0; usort($objects, array('myObj', 'compare')); echo ("var1 var2 var3\n"); foreach($objects as $o)echo $o."\n";
$sorts=Array('var2', 'var3', 'var1'); $sort = 0; usort($objects, array('myObj', 'compare')); echo ("\nvar2 var3 var1\n"); foreach($objects as $o)echo $o."\n";
$sorts=Array('var2', 'var1', 'var3'); $sort = 0; usort($objects, array('myObj', 'compare')); echo ("\nvar2 var1 var3\n"); foreach($objects as $o)echo $o."\n";

?>

Paul Geraghty foofoonet at the G Mall (27-Nov-2009 07:42)

For anyone else sorting mixed RSS feeds in date order, here's an example of the perhaps not so obvious way of calling a method from the same class using usort():

<?php
class MyAggregator {

  static function
cmp_pubdate( $a, $b ) {
   
$a_t = strtotime( $a['pubdate'] ) ;
   
$b_t = strtotime( $b['pubdate'] ) ;

    if(
$a_t == $b_t ) return 0 ;
    return (
$a_t > $b_t ) ? -1 : 1;
  }

// assemble arrays for display in date order
 
function all_documents(){
   
$all_data  = array_merge (
   
$this->upcoming(), $this->past() ) ;

// Use within its own class using the $this syntax so:
   
usort( $all_data, array( $this , "cmp_pubdate" ) ) ;

  return
$all_data ;
  }
}
?>

As previously said, use as a static function in other parts of your code:

<?php usort ( $a, array( "MyAggregator", "cmp_pubdate" ) ) ; ?>

Rogier (16-Nov-2009 11:50)

<?php
// I have seen many examples of sorting, almost all of which
// are too specific and require one implementation per property
// on which to sort.
// So I decided to use Reflection, implementing a more generic approach that in fact turned out
// to resemble an approach I used in the early days of .NET...

// Intentionally, I did not do any checking on existing
// items. This is just to keep simplicity and to
// demonstrate the sorting functionality.

// A more real-life appraoach would require e.g. a collection that is based
// on implementing the Iterator, ArrayAccess and Countable interfaces.

// Take note that this implementation is specific for PHP5+ only
// This code was tested on PHP 5.0.4

class SortableItem
{
    static public
$sortProperty;
   
    static function
USortAsc($a, $b)
    {
       
/*@var $_pd ReflectionProperty*/
       
$_pd = self::$sortProperty;
        if (
$_pd !== null)
        {
            if (
$_pd->getValue($a) === $_pd->getValue($b))
                return
0;
            else
                return ((
$_pd->getValue($a) < $_pd->getValue($b))?-1:1);
        }
        return
0;
    }

    static function
USortDesc($a, $b)
    {
        return -(
self::USortAsc($a,$b));
    }

}
class
Item extends SortableItem
{
    public
$name;
    public
$index;
    public
$description;
   
    function
__construct($nam,$idx,$desc)
    {
       
$this->name = $nam;
       
$this->index = $idx;
       
$this->description = $desc;
    }
    function
__toString()
    {
        return
"$this->index; $this->name; $this->description\n";
    }
}
class
ItemCollection
{
    protected
$_array = array();
    protected
$_itemDescriptor;
   
    function
__construct()
    {
       
$this->_itemDescriptor = new ReflectionClass('Item');
    }
   
    function
Add(Item $item)
    {
       
$this->_array[] = $item;
    }
   
    function
Sort($property, $asc=true)
    {
       
// this is where sorting logic takes place
       
$_pd = $this->_itemDescriptor->getProperty($property);
        if (
$_pd == null)
        {
           
user_error('Property '.$property.' does not exist in class '.$this->_itemDescriptor->getName(), E_WARNING);
            return;
        }
       
// set sortDescriptor
       
Item::$sortProperty = $_pd;
       
// and apply sorting
       
usort($this->_array, array('Item', ($asc?'USortAsc':'USortDesc')));
    }
   
    function
getItems(){return $this->_array;}
}

//testing it....
$utime = microtime(true);
$coll = new ItemCollection();
$coll->Add( new Item('apple',0,'a sour fruit') );
$coll->Add( new Item('pear',54,'delicious pears') );
$coll->Add( new Item('mango',245,'bread and butter') );

echo
PHP_EOL,'sort by index, asc',PHP_EOL;
$coll->Sort('index',true);
$items = $coll->getItems();
foreach(
$items as $item)
{
    echo
$item->__toString();
}

echo
PHP_EOL,'sort by index, desc',PHP_EOL;
$coll->Sort('index',false);
$items = $coll->getItems();
foreach(
$items as $item)
{
    echo
$item->__toString();
}

echo
PHP_EOL,'sort by name, asc',PHP_EOL;
$coll->Sort('name',true);
$items = $coll->getItems();
foreach(
$items as $item)
{
    echo
$item->__toString();
}

echo
PHP_EOL,'sort by name, desc',PHP_EOL;
$coll->Sort('name',false);
$items = $coll->getItems();
foreach(
$items as $item)
{
    echo
$item->__toString();
}
$utime = microtime(true)-$utime;
echo
PHP_EOL,' sorting all took ',round(1000*$utime,2),' ms';
?>

Will Shaver (27-Aug-2009 10:31)

An even better implementation of osort [than my original, posted on 24-AUG-09 (since deleted)], allowing for multiple properties and directions.  With php 5.3.0 sorting by properties of an object becomes MUCH simpler.  Note that this uses anonymous functions / closures. Might find reviewing the php docs on that useful.  Look below for examples for previous version of php.

<?php
function osort(&$array, $props)
{
    if(!
is_array($props))
       
$props = array($props => true);
       
   
usort($array, function($a, $b) use ($props) {
        foreach(
$props as $prop => $ascending)
        {
            if(
$a->$prop != $b->$prop)
            {
                if(
$ascending)
                    return
$a->$prop > $b->$prop ? 1 : -1;
                else
                    return
$b->$prop > $a->$prop ? 1 : -1;
            }
        }
        return -
1; //if all props equal       
   
});   
}
?>

Usage:

<?php
osort
($items, array("Color" => true, "Size" => false));
//or
osort($items, "Color");
?>

maarten at xel dot nl (17-Jul-2009 04:45)

If you ever have to sort a collection of objects on something like a string (name) present in every object, but want to keep the array of objects intact you might find this useful:

<?php
function naturalSortObjectArray($objectArray) {
        function
naturalSortByName($a, $b) {
            return
strnatcmp($a->name, $b->name);
        }
       
usort($objectArray, "naturalSortByName");
        return
$objectArray;
}
?>

majkl578 at gmail dot com (26-Jun-2009 01:25)

As of PHP 5.3 it is possible to use anonymous functions:

<?php
$arrayToSort
= array(2,6,1,9,3);

/* As of PHP 5.3 */
usort($arrayToSort, function($a, $b) {
    return
$a > $b ? 1 : -1;
});

var_dump($arrayToSort);

/* Returns:
array
  0 => int 1
  1 => int 2
  2 => int 3
  3 => int 6
  4 => int 9
*/
?>

phpguy at lifetoward dot com (12-Jun-2009 01:54)

I recommend that you take special note of the fact that an INTEGER value must be returned from a sorting callback function. So, let's say you want to sort arrays by a quotient of two of their elements and to do so you write something like:
<?php
function sorter($a, $b)
{ return
$a['num']/$a['denom'] - $b['num']/$b['denom']; }
?>

You may not get the result you want because probably $x['num']/$x['denom'] has absolute value less than 1 and you'll get a lot of "same value" effective results from the comparator function as integer rounding occurs.

To solve this just boost up the quotients to be big integers, then subtract them:

<?php
function sorter($a, $b)
{ return
1000*$a['num']/$a['denom'] - 1000*$b['num']/$b['denom']; }
?>

huskyr at gmail dot com (28-May-2009 02:04)

Remember that functions inside of functions will become part of the global scope too. So, something like:

<?php
   
function foo($array) {
        function
compare($a,$b) {
            return
$a < $b;
        }
       
usort($array, "compare");
        return
$array;
    }
   
    function
bar($array) {
        function
compare($a,$b) {
            return
$a > $b;
        }
       
usort($array, "compare");
        return
$array;
    }
   
   
foo($something);
   
bar($something_else);
?>
       
Will result in a fatal error because you're redeclaring 'compare'. This could be a little strange, e.g. for JavaScript programmers who expect functions in functions to become private outside of the parent scope.

gmail.com - nmcquay (31-Mar-2009 08:25)

I wrote a wrapper for usort that lets you use something similar to an SQL ORDER BY clause. It can sort arrays of associative arrays and arrays of objects and I think it would work with some hybrid case.

Example of how the function works:

<?php
$testAry
= array(
  array(
'a' => 1, 'b' => 2, 'c' => 3),
  array(
'a' => 2, 'b' => 1, 'c' => 3),
  array(
'a' => 3, 'b' => 2, 'c' => 1),
  array(
'a' => 1, 'b' => 3, 'c' => 2),
  array(
'a' => 2, 'b' => 3, 'c' => 1),
  array(
'a' => 3, 'b' => 1, 'c' => 2)
);

Utility::orderBy($testAry, 'a ASC, b DESC');

//Result:
$testAry = array(
  array(
'a' => 1, 'b' => 3, 'c' => 2),
  array(
'a' => 1, 'b' => 2, 'c' => 3),
  array(
'a' => 2, 'b' => 3, 'c' => 1),
  array(
'a' => 2, 'b' => 1, 'c' => 3),
  array(
'a' => 3, 'b' => 2, 'c' => 1),
  array(
'a' => 3, 'b' => 1, 'c' => 2)
);
?>

To sort an array of objects you would do something like:
Utility::orderBy($objectAry, 'getCreationDate() DESC, getSubOrder() ASC');

This would sort an array of objects that have methods getCreationDate() and getSubOrder().

Here is the function:

<?php
class Utility {
   
/*
    * @param array $ary the array we want to sort
    * @param string $clause a string specifying how to sort the array similar to SQL ORDER BY clause
    * @param bool $ascending that default sorts fall back to when no direction is specified
    * @return null
    */
   
public static function orderBy(&$ary, $clause, $ascending = true) {
       
$clause = str_ireplace('order by', '', $clause);
       
$clause = preg_replace('/\s+/', ' ', $clause);
       
$keys = explode(',', $clause);
       
$dirMap = array('desc' => 1, 'asc' => -1);
       
$def = $ascending ? -1 : 1;

       
$keyAry = array();
       
$dirAry = array();
        foreach(
$keys as $key) {
           
$key = explode(' ', trim($key));
           
$keyAry[] = trim($key[0]);
            if(isset(
$key[1])) {
               
$dir = strtolower(trim($key[1]));
               
$dirAry[] = $dirMap[$dir] ? $dirMap[$dir] : $def;
            } else {
               
$dirAry[] = $def;
            }
        }

       
$fnBody = '';
        for(
$i = count($keyAry) - 1; $i >= 0; $i--) {
           
$k = $keyAry[$i];
           
$t = $dirAry[$i];
           
$f = -1 * $t;
           
$aStr = '$a[\''.$k.'\']';
           
$bStr = '$b[\''.$k.'\']';
            if(
strpos($k, '(') !== false) {
               
$aStr = '$a->'.$k;
               
$bStr = '$b->'.$k;
            }

            if(
$fnBody == '') {
               
$fnBody .= "if({$aStr} == {$bStr}) { return 0; }\n";
               
$fnBody .= "return ({$aStr} < {$bStr}) ? {$t} : {$f};\n";               
            } else {
               
$fnBody = "if({$aStr} == {$bStr}) {\n" . $fnBody;
               
$fnBody .= "}\n";
               
$fnBody .= "return ({$aStr} < {$bStr}) ? {$t} : {$f};\n";
            }
        }

        if(
$fnBody) {
           
$sortFn = create_function('$a,$b', $fnBody);
           
usort($ary, $sortFn);       
        }
    }
}
?>

luke dot semerau at gmail dot com (28-Mar-2009 08:25)

If you need to use usort with a key in the calling method, I wrote this as a utility:
<?php

function usort_comparison($obj, $method, $key) {
   
$usorter = &new Usort($obj, $method, $key);
    return array(
$usorter, "sort");
}

class
Usort {
    function
__construct($obj, $method, $key) {
       
$this->obj = $obj;
       
$this->method = $method;
       
$this->key = $key;
    }
    function
sort($a, $b) {
        return
call_user_func_array(array($this->obj, $this->method), array($a, $b, $this->key));
    }
}

?>

<?php

require_once("util/usort.php");

class
Foo {
   
$items = array(FooBar(13), FooBar(2));
    public function
sorter() {
       
usort($this-items, usort_comparison("Foo", "_cmp", "item"));
    }

    public static function
_cmp($a, $b, $key) {
         return
strcasecmp($a->$key, $b->$key);
    }

}

class
FooBar {
    public
$item;
    function
__construct($val) {
       
$this->item = $val;
    }
}

?>

~ simple example... but in the way I need to use it was the key was used in a switch statement to choose the different member of the object to compare against dynamically (as in, sort by x or y or z)

fig dot miguel at gmail dot com (12-Feb-2009 12:29)

I often need to order arrays by one dimension, therefore, I implemented a generic function, called "g_arr_dimsort":

<?php
function arr_dimsort_cmp($a,$b)
/*
 *      Compare function used when sorting arrays.
 */
{
  global
$G_ARR_STYPE, $G_ARR_SDIM;

 
/* -- Sort numbers? */

 
if ($G_ARR_STYPE == 'NUMBER') {

      if ((float)
$a[$G_ARR_SDIM] == (float)$b[$G_ARR_SDIM]) return 0;

      return (
floatval($a[$G_ARR_SDIM]) > floatval($b[$G_ARR_SDIM])) ? 1: -1;
  }
 
/* -- Sort strings? */

 
if ($G_ARR_STYPE == 'STRING') return strcmp($a[$G_ARR_SDIM],$b[$G_ARR_SDIM]);

 
/* -- First time: get the right data type */

 
$G_ARR_STYPE = is_string($a[$G_ARR_SDIM])? 'STRING' : 'NUMBER';

  return
arr_dimsort_cmp($a,$b);
}

function
g_arr_dimsort(&$arr,$dim,$type = '',$keepkey = false)
/*
 *      Sort an array by a given dimension
 */
{
  global
$G_ARR_SDIM, $G_ARR_STYPE;

 
$G_ARR_SDIM = $dim; $G_ARR_STYPE = $type;

  if (
$keepkey) uasort(&$arr,'arr_dimsort_cmp');
  else
     
usort(&$arr,'arr_dimsort_cmp');
}

/* -- Testing it: */

$arr[] = array('Fruit' => 'Orange','Stock' => 10, 'Price'=> 10.2);
$arr[] = array('Fruit' => 'Lemon' ,'Stock' => 100,'Price'=> 5.36);
$arr[] = array('Fruit' => 'Apple' ,'Stock' => 20,'Price'=> 11.1);

echo
"Sort by Fruit\n"; g_arr_dimsort(&$arr,'Fruit'); print_r($arr);
echo
"Sort by Stock\n"; g_arr_dimsort(&$arr,'Stock','NUMBER'); print_r($arr);
echo
"Sort by Fruit and keep keys\n"; g_arr_dimsort(&$arr,'Fruit','',true); print_r($arr);
echo
"Sort by Price\n"; g_arr_dimsort(&$arr,'Price'); print_r($arr);

?>

Anonymous (12-Jan-2009 11:14)

To sort reliably on more than one "column" in database-style arrays, handle this within your cmp function where the first field to be sorted returns 0:

<?php

function cmp($a, $b){
   
 if(
$a[field_1] == $b[field_1]){

  if(
$a[field_2] == $b[field_2]){

   return
0;

  }

  elseif(
$a[field_2] > $b[field_2]){

   return -
1;

  }

  elseif(
$a[field_2] < $b[field_2]){

   return
1;

  }

 }

 elseif(
$a[field_1] > $b[field_1]){

  return -
1;

 }

 elseif(
$a[field_1] < $b[field_1]){

  return
1;

 }

}

?>

Sorting by doing multiple passes does not seem to be reliable.

jalil at measat dot org (29-Dec-2008 01:37)

<?php
/*---------------------------------------------------------
* my own home made easy object sort, which
* i cannot find anywhere on the net
* at all, tut. i can find only complicated ones,
* which brings me a headache.
*
* You can enhance it to return all sorts of error
* conditions if you wish,
* i need nothing but a false return upon failure to sort,
* so that is the only error i have here
*
* Example usage:
*
* INPUT                 -       $objects_array
// an array of objects for sorting

* PARAMETERS    -       property
// the property of the object to be sorted

* OUTPUT                -       $engine
// an engine object created by new,
// with your arrays of objects sorted according to your
// selected property
//( the sorting is done upon sort object creation )
*
* Code Examples
*
* $engine = new objSorter($objects_array);
// sorts on FIRST property -  default

* $engine = new objSorter($objects_array,'property');
// sort on ANY specific property
*--------------------------------------------------------*/

class objSorter
{
var
$property;
var
$sorted;

    function
ObjSorter($objects_array,$property=null)
        {
           
$sample    = $objects_array[0];
           
$vars    = get_object_vars($sample);

        if (isset(
$property))
            {
            if (isset(
$sample->$property))
// make sure requested property is correct for the object
               
{   
               
$this->property = $property;
               
usort($objects_array, array($this,'_compare'));
                }
            else
                {   
               
$this->sorted    = false;
                return;   
                }
            }
        else
            {   
                list(
$property,$var)     = each($sample);
               
$this->property         = $property;
               
usort($objects_array, array($this,'_compare'));
            }

       
$this->sorted    = ($objects_array);
        }

    function
_compare($apple, $orange)
        {
       
$property    = $this->property;
        if (
$apple->$property == $orange->$property) return 0;
        return (
$apple->$property < $orange->$property) ? -1 : 1;
        }
}
// end class
?>

USAGE EXAMPLE
DUMP ORIGINAL
user Object ( [name] => Yunihe Jopoba [age] => 27 [richness] => ??? 899,970 )
user Object ( [name] => Janirevi Fakejorumoa [age] => 19 [richness] => ??? 219,078 )
user Object ( [name] => Korejowi Mezede [age] => 95 [richness] => ??? 3,272 )
user Object ( [name] => Nugoaivu Jongyi [age] => 84 [richness] => ??? 94,853 )
user Object ( [name] => Cepomase Buaesukoyua [age] => 32 [richness] => ??? 677,180 )
user Object ( [name] => Vejosehona Auva [age] => 20 [richness] => ??? 144,540 )
user Object ( [name] => Fewame Wojuvuzo [age] => 69 [richness] => ??? 198,231 )
user Object ( [name] => Risuku Zagedobu [age] => 48 [richness] => ??? 763,860 )
user Object ( [name] => Fazurada Aayu [age] => 16 [richness] => ??? 302,352 )

SORTED by age

<?php
$objects               
= new ObjSorter($objects_array,'age');
if (
$objects->sorted)
{
$objects_array  = $objects->sorted;
foreach (
$objects_array as $key=>$object) { print_r($object); echo "<br />"; }
}
?>

user Object ( [name] => Fazurada Aayu [age] => 16 [richness] => ??? 302,352 )
user Object ( [name] => Janirevi Fakejorumoa [age] => 19 [richness] => ??? 219,078 )
user Object ( [name] => Vejosehona Auva [age] => 20 [richness] => ??? 144,540 )
user Object ( [name] => Yunihe Jopoba [age] => 27 [richness] => ??? 899,970 )
user Object ( [name] => Cepomase Buaesukoyua [age] => 32 [richness] => ??? 677,180 )
user Object ( [name] => Risuku Zagedobu [age] => 48 [richness] => ??? 763,860 )
user Object ( [name] => Fewame Wojuvuzo [age] => 69 [richness] => ??? 198,231 )
user Object ( [name] => Nugoaivu Jongyi [age] => 84 [richness] => ??? 94,853 )
user Object ( [name] => Korejowi Mezede [age] => 95 [richness] => ??? 3,272 )

SORTED by richness

<?php
$objects               
= new ObjSorter($objects_array,'richness');
if (
$objects->sorted)
{
$objects_array  = $objects->sorted;
foreach (
$objects_array as $key=>$object) { print_r($object); echo "<br />"; }
}
?>

user Object ( [name] => Vejosehona Auva [age] => 20 [richness] => ??? 144,540 )
user Object ( [name] => Fewame Wojuvuzo [age] => 69 [richness] => ??? 198,231 )
user Object ( [name] => Janirevi Fakejorumoa [age] => 19 [richness] => ??? 219,078 )
user Object ( [name] => Korejowi Mezede [age] => 95 [richness] => ??? 3,272 )
user Object ( [name] => Fazurada Aayu [age] => 16 [richness] => ??? 302,352 )
user Object ( [name] => Cepomase Buaesukoyua [age] => 32 [richness] => ??? 677,180 )
user Object ( [name] => Risuku Zagedobu [age] => 48 [richness] => ??? 763,860 )
user Object ( [name] => Yunihe Jopoba [age] => 27 [richness] => ??? 899,970 )
user Object ( [name] => Nugoaivu Jongyi [age] => 84 [richness] => ??? 94,853 )

Simulated wrong property request ( dumb property )

<?php
$objects               
= new ObjSorter($objects_array,'dumb property');
if (
$objects->sorted)
{
$objects_array  = $objects->sorted;
foreach (
$objects_array as $key=>$object) { print_r($object); echo "<br />"; }
}
else echo
'DUMB ERROR';
?>

DUMB ERROR

drorasta (22-Jun-2008 06:16)

Here's how you can usort() a multidimensional array (like in example #2 above) within a class:

<?php usort($myArray, array("className", "cmp")); ?>

Ariz Jacinto (13-May-2008 06:50)

Here's how to use usort() within a class using a static function as a callback (using the example above):

<?php

class MyObj {
    var
$name;

    function
SampleObj($name){
       
$this->name = $name;

       
usort($this->name, array(&$this, "compareValues"));

    }

    static function
compareValues($a, $b){
       
$al = strtolower($a->name);
       
$bl = strtolower($b->name);
        if (
$al == $bl) {
            return
0;
        }
        return (
$al > $bl) ? +1 : -1;
    }
}

?>

Anonymous (14-Mar-2008 12:37)

From the docs the user defined function looks as it could be arbitrary. This is not the case.
I needed a comparison that would send arbitrary values at the end of the array. Say '0' means invalid for example.
So here is a sample function.

<?php
function array_cmp($a, $b) {
  if(
$a == 0 ) {
    return
99;
  } elseif(
$a $b ) {
    return
1;
  } elseif(
$a == $b ) {
    return
0;
  } elseif(
$a $b ) {
    return -
1;
  }
}

usort($test_array, "array_cmp");
print
'<pre>'; print_r( $test_array ); print '</pre>';

$test_array = array(
  
'a' => 8 ,
  
'b' => 0 ,
  
'c' => 1 ,
  
'd' => 0 ,
  
'e' => 3
 
);

Output:

Array
(
    [
0] => 0
   
[1] => 1
   
[2] => 8
   
[3] => 0
   
[4] => 3
)
?>

This is beacause comparisons aren't applied to all possible pairs. So when the '0' is tested as $b strange things can occur...

This is solved simply adding an
  } elseif( $b == 0) {
    return -99;
  }
statement.

Carefull of the pitfalls. If you alter the ordering in strange ways without knowledge in the underlying algorithm one could even trigger infinite loops. (if your testing for $a and $b for the same value give inconsistent results. )

Sid_M (06-Nov-2007 01:54)

The sample function for having the sort function be a class method has a comment identifying the sorting function as static, however the function does not have the static keyword. In PHP 5 (at least as configured on my server), usort will fail, identifying the method as non-static. Preceding the function keyword with the static keyword fixed the problem.

(15-Mar-2007 01:12)

A simple way of having reversed sort order from usort() function without using array_reverse() is to change "greater than" to "lesser that" sign (or vice versa) in the compare function.

Tim (13-Nov-2006 11:43)

If you want to sort an array of strings by the length of its values, you can write a better cmp-function than manually comparing string lengths with if-statements. Unfortunately, I see this bad technique in other people's code. I prefer using this:

<?php
function length_cmp( $a, $b ) {
    return
strlen($a)-strlen($b) ;
}
?>

This function sorts the array in ascending order. If you want to sort descending, simply swap $a and $b either in the parameters or in the subtraction.

-Tim

svenxy AT nospam gmx net (16-Oct-2006 09:58)

This will sort subnets correctly:

<?php

$zones
=
array(
'192.168.11',
'192.169.12',
'192.168.13',
'192.167.14',
'192.168.15',
'122.168.16',
'192.168.17'
);

function
sort_subnets ($a, $b) {
   
$a_arr = explode('.', $a);
   
$b_arr = explode('.', $b);
    foreach (
range(0,3) as $i) {
        if (
$a_arr[$i] < $b_arr[$i] ) {
            return -
1;
        }
        elseif (
$a_arr[$i] > $b_arr[$i] ) {
            return
1;
        }
    }
    return -
1;
}

usort($zones, 'sort_subnets');
print
'<pre>';
print_r($zones);
print
'</pre>';

?>

stephen in koto (06-Apr-2006 06:28)

For using usort inside a method in an object, where the callback sort method is in the same object, this works:

<?php usort($arr_to_sort, array($this, "sort_terms_by_criteria")); ?>

If you wish to keep elements in their original or reverse order if they are the same length, just don't return zero for items that compare the same. Return a 1 or -1, as appropriate.

sydney at totoche dot org (16-Jan-2006 09:44)

Instead of doing  :

<?php $strc = strcmp( strtolower($a[$f]), strtolower($b[$f]) ); ?>

you could do this :

<?php $strc = strcasecmp( $a[$f], $b[$f] ); ?>

which is more efficient and is does case insensitive comparison according to the current locale.

sean at NOSPAM dot orwd dot com (23-Sep-2005 10:46)

In order to get a proper text sorting I have changed the arfsort() function submitted by jonathan(at)inetz(dot)com.

The one line I have changed is:

<?php
$strc
= strcmp( $a[$f], $b[$f] );
?>

to

<?php
$strc
= strcmp( strtolower($a[$f]), strtolower($b[$f]) );
?>

It can now sort correctly for alphabetization.  Capital letters where getting in the way.

Sean

Tim (22-Sep-2005 03:25)

A couple examples here advocate the use of 'create_function' for sorting, which is tempting to use because of the limitations of usort. But beware this method -- the function created will NOT be freed at the end of the sorting routine, which creates a memory leak. For this reason, this method should probably never be used.

If you need multi-key or other complex sorting, the fundamental problem is passing in parameters into the comparison routine. I suggest creating a global variable (_array_key_multisort_parameters or something long), and controlling the comparison routine in that way.

rpmPUBLI at iespana dot es (03-Sep-2005 08:48)

(I've browsed the docummented notes and I haven't found this note, so there I go):

Please note that, when sorting associative arrays (i.e. non-numeric indexes), these will be lost and replaced by a regular numeric index starting at 0.

reinhard at ess dot co dot at (08-Aug-2005 02:34)

maybe someone can use this.
with that compare-function you can get this order:

string1, string2, ..., string10, string11, ...string22...

else the functions make something like

string10,string11,...string1,string20....
or
string1,string10,string11,string2,string20...

it's not the best solution, but works for my purpose...

<?php
function cmp($a,$b){
   list(
$a)=explode(".",$a);
   list(
$b)=explode(".",$b);
  
$s=0;
   for(
$i=0;$i<=strlen($a);++$i){
      if(
is_numeric($a[$i])&&is_numeric($b[$i])){
        
$n=1;
        
$anum=$bnum=0;
         while((
is_numeric($a[$i])||is_numeric($b[$i]))&&
                    (
strlen($a)>=$i||strlen($b)>=$i)){
            if(
is_numeric($a[$i])&&$i<=strlen($a)) $anum=$a[$i]+$anum*$n;
            if(
is_numeric($b[$i])&&$i<=strlen($b)) $bnum=$b[$i]+$bnum*$n;
           
$n*=10;
            ++
$i;
         }
         if(
$n>1) --$i;
         if(
$anum!=$bnum) return $anum<$bnum?-1:1;
      }elseif(
$a[$i]!=$b[$i]) return $a[$i]<$b[$i]?-1:1;
   }
}
?>

use it like this:

<?php
usort
($array,"cmp");
?>

Jeremy Swinborne (20-Jul-2005 09:56)

When I query a DB I usually put my record set inside of a multi-dimentional array.  I finally wrote a program that will allow you to sort your record set by column after you put it in an array.

<?php
$test
= array();
$test[0]['name'] = 'jeremy';
$test[0]['email'] = 'lala@example.com';
$test[0]['phone'] = '123-123-1234';
$test[0]['trick'] = 'mezopia';

$test[1]['name'] = 'Amanda';
$test[1]['email'] = 'hot@example.com';
$test[1]['phone'] = '123-123-1235';
$test[1]['trick'] = 'youarecool';

$test[2]['name'] = 'john';
$test[2]['email'] = 'wowee@example.com';
$test[2]['phone'] = '123-123-3333';
$test[2]['trick'] = 'goneinanhour';

print_r(columnSort($test, 'name'));

function
columnSort($unsorted, $column) {
   
$sorted = $unsorted;
    for (
$i=0; $i < sizeof($sorted)-1; $i++) {
      for (
$j=0; $j<sizeof($sorted)-1-$i; $j++)
        if (
$sorted[$j][$column] > $sorted[$j+1][$column]) {
         
$tmp = $sorted[$j];
         
$sorted[$j] = $sorted[$j+1];
         
$sorted[$j+1] = $tmp;
      }
    }
    return
$sorted;
}
?>

dmhouse at gmail dot com (19-Jul-2005 10:09)

The easiest way to compare two integers is just to take the second away from the first. For example, say you wanted to sort by an integer property of an object. Your comparison function would look like this:

<?php
function compare_counts($a, $b) {
  return
$a->count - $b->count;
}
?>

This works because you don't necessarily have to return -1, 0 or 1, the manual states any integer less than, equal to or greater than 0 is OK.

steve at tracorp dot com (13-Apr-2005 12:57)

When sorting a large multi-dimensional array, I ran into an issue where the array was not being sorted either ascending or descending, even when it started in sorted order.  It turns out that the above note about the callback function returning an integer is true.  My comparison function was just a subtraction between two floating point numbers, and the result being a float produced very unpredictable results.

guenther dot stadler at gmx dot net (30-Mar-2005 10:25)

Just something i stumbled about right now:
If the array consists of just one elemtent, the user-function is not called at all.

Although this surely makes sense, think of it if you want to use your order-function for adding extra data to your arrays...

ulrichUNDERSCOREalexis at yahoo dot com (04-Mar-2005 03:03)

Please note that:
- the HTML entities should be replaced by their accented counterparts;
- the $patterns arrays have been split for display convenience.

<?php

/* returns the collated string (with no accent or with the matching string
 * replacement) in lower case according to that language rule.
 * The aim is to alphabetically sort lists of strings with characters from
 * other languages but using collation rules of that given language
 * (ISO 639-1 code).
 * Latin-derived alphabets are supported (currently English, French and
 * German)
 * rules source: http://en.wikipedia.org/wiki/Latin_alphabet
 */
function collatedLower($string, $lang=null) {
   switch (
$lang) {
       case
'de':
          
// German
       
$patterns = array(
       
"/&aacute;|&agrave;|&acirc;|&atilde;|&aring;|
&Aacute;|&Agrave;|&Acirc;|&Atilde;|&Aring;/"
,
       
"/&auml;|&aelig;|&Auml;|&AElig;/",
       
"/&ccedil;|&Ccedil;/",
       
"/&eacute;|&egrave;|&ecirc;|&euml;|
&Eacute;|&Egrave;|&Ecirc;|&Euml;/"
,
       
"/&igrave;|&iacute;|&icirc;|&iuml;|
&Igrave;|&Iacute;|&Icirc;|&Iuml;/"
,
       
"/&ntilde;|&Ntilde;/",
       
"/&ograve;|&oacute;|&ocirc;|&otilde;|&oslash;|
&Ograve;|&Oacute;|&Ocirc;|&Otilde;|&Oslash;/"
,
       
"/&ouml;|&oelig;|&Ouml;|&OElig;/",
       
"/&szlig;/",
       
"/&ugrave;|&uacute;|&ucirc;|
&Ugrave;|&Uacute;|&Ucirc;/"
,
       
"/&uuml;|&Uuml;/",
       
"/&yacute;|&yuml;|&Yacute;/");
          
$replace = array('a', 'ae', 'c', 'e', 'i', 'n', 'o', 'oe', 'ss', 'u', 'ue', 'y');
           break;
       default:
          
// 'en' (English), 'fr' (French)
          
$patterns = array(
       
"/&aacute;|&agrave;|&acirc;|&atilde;|&auml;|&aring;|
&Aacute;|&Agrave;|&Acirc;|&Atilde;|&Auml;|&Aring;/"
,
       
"/&aelig;|&AElig;/",
       
"/&ccedil;|&Ccedil;/",
       
"/&eacute;|&egrave;|&ecirc;|&euml;|
&Eacute;|&Egrave;|&Ecirc;|&Euml;/"
,
       
"/&igrave;|&iacute;|&icirc;|&iuml;|
&Igrave;|&Iacute;|&Icirc;|&Iuml;/"
,
       
"/&ntilde;|&Ntilde;/",
       
"/&ograve;|&oacute;|&ocirc;|&otilde;|&ouml;|&oslash;|
&Ograve;|&Oacute;|&Ocirc;|&Otilde;|&Ouml;|&Oslash;/"
,
       
"/&oelig;|&OElig;/",
       
"/&szlig;/",
       
"/&ugrave;|&uacute;|&ucirc;|&uuml;|
&Ugrave;|&Uacute;|&Ucirc;|&Uuml;/"
,
       
"/&yacute;|&yuml;|&Yacute;/");
          
$replace = array('a', 'ae', 'c', 'e', 'i', 'n', 'o', 'oe', 'ss', 'u', 'y');
           break;
       }
   return
preg_replace($patterns,$replace,$string);
}

// English
function compareAccents_en($a, $b) {
   return
compareAccents($a, $b, 'en');
}

// French
function compareAccents_fr($a, $b) {
   return
compareAccents($a, $b, 'fr');
}

// German
function compareAccents_de($a, $b) {
   return
compareAccents($a, $b, 'de');
}

/*
 * comparison function to group together accented letters with
 * their lower-case non-accented counterparts
 * the $lang parameter enables sorting rules for that language
 * (ISO 639-1 code)
 */
function compareAccents($a, $b, $lang=null) {
  
$anew = strtolower(collatedLower($a,$lang));
  
$bnew = strtolower(collatedLower($b,$lang));
   if (
$anew < $bnew) return -1;
   if (
$anew > $bnew) return 1;
   return
0;
}

// usage:
usort($myList,'compareAccents_fr');

// to be compared to:
setlocale(LC_COLLATE,'fr');
usort($myList, 'strcoll');

?>

Raveler at telenet dot be (20-May-2004 06:02)

The array_alternate_multisort function written by robert below doesn't work. There are several bugs in the code and it doesn't work when sorting by multiple keys because the order of the first key isn't taken into account when sorting by the second key and so on. Also, because robert uses strcasecmp the algorithm doesn't work properly with floats or other variable types. Here's the improved version:

<?php
   
function SortArray() {
       
$arguments = func_get_args();
       
$array = $arguments[0];
       
$code = '';
        for (
$c = 1; $c < count($arguments); $c += 2) {
            if (
in_array($arguments[$c + 1], array("ASC", "DESC"))) {
               
$code .= 'if ($a["'.$arguments[$c].'"] != $b["'.$arguments[$c].'"]) {';
                if (
$arguments[$c + 1] == "ASC") {
                   
$code .= 'return ($a["'.$arguments[$c].'"] < $b["'.$arguments[$c].'"] ? -1 : 1); }';
                }
                else {
                   
$code .= 'return ($a["'.$arguments[$c].'"] < $b["'.$arguments[$c].'"] ? 1 : -1); }';
                }
            }
        }
       
$code .= 'return 0;';
       
$compare = create_function('$a,$b', $code);
       
usort($array, $compare);
        return
$array;
    }
?>

todor at todor dot net (08-Mar-2004 12:39)

To sort multidimentional arrays .... by one key.

<?php
function multi_sort($tab,$key){
   
$compare = create_function('$a,$b','if ($a["'.$key.'"] == $b["'.$key.'"]) {return 0;}else {return ($a["'.$key.'"] > $b["'.$key.'"]) ? -1 : 1;}');
   
usort($tab,$compare) ;
    return
$tab ;
}
?>

arjini at mac dot com (27-Jan-2004 06:05)

<?php
/*
This is a class I built to sort parent/child relationships of array elements.
I post this here, because thanks to usort, you can also assign an explicit order
to the elements.

I first built this to sort categories and subcategories.

My database has four fields. category_id, parent_id, category_name, category_position

$rows is an associative array from the database with my categories.
*/
$rows = array( 0=>array('category_id'=>1,'parent_id' =>3,'category_name' =>'Second Child','category_position'=>2),
                   
1=>array('category_id' =>2,'parent_id' =>0,'category_name' =>'Second Parent','category_position'=>2),
                   
2=>array('category_id' =>3,'parent_id' =>0,'category_name' =>'First Parent','category_position'=>1),
                   
3=>array('category_id' =>4,'parent_id' =>0,'category_name' =>'Third Parent','category_position'=>3),
                   
4=>array('category_id' =>5,'parent_id' =>3,'category_name' =>'First Child','category_position'=>1),
                   
5=>array('category_id' =>6,'parent_id' =>5,'category_name'=>'Second Sub-Child','category_position'=>2),
                   
6=>array('category_id' =>7,'parent_id' =>5,'category_name' =>'First Sub-Child','category_position'=>1)
                    );

$ordered = chain('category_id', 'parent_id', 'category_position', $rows);

foreach(
$ordered as $item)
{
    echo
str_repeat('------', $item['indent']).$item['category_name'].'<br>';
}

/*

Output

First Parent
------First Child
------------First Sub-Child
------------Second Sub-Child
------Second Child
Second Parent
Third Parent

You can have it only return a certain "branch" if you specify a root_id.
Aditionally, you can keep it by going to deep by specifying max-level.

Hope someone finds this useful, I sure would have liked to see this here a week ago.

Ah yes... and the code that runs it.
*/

function chain($primary_field, $parent_field, $sort_field, $rows, $root_id=0, $maxlevel=25)
{
   
$c = new chain($primary_field, $parent_field, $sort_field, $rows, $root_id, $maxlevel);
    return
$c->chain_table;
}

class
chain
{
    var
$table;
    var
$rows;
    var
$chain_table;
    var
$primary_field;
    var
$parent_field;
    var
$sort_field;
   
    function
chain($primary_field, $parent_field, $sort_field, $rows, $root_id, $maxlevel)
    {
       
$this->rows = $rows;
       
$this->primary_field = $primary_field;
       
$this->parent_field = $parent_field;
       
$this->sort_field = $sort_field;
       
$this->buildChain($root_id,$maxlevel);
    }

    function
buildChain($rootcatid,$maxlevel)
    {
        foreach(
$this->rows as $row)
        {
           
$this->table[$row[$this->parent_field]][ $row[$this->primary_field]] = $row;
        }
       
$this->makeBranch($rootcatid,0,$maxlevel);
    }
           
    function
makeBranch($parent_id,$level,$maxlevel)
    {
       
$rows=$this->table[$parent_id];
        foreach(
$rows as $key=>$value)
        {
           
$rows[$key]['key'] = $this->sort_field;
        }
       
       
usort($rows,'chainCMP');
        foreach(
$rows as $item)
        {
           
$item['indent'] = $level;
           
$this->chain_table[] = $item;
            if((isset(
$this->table[$item[$this->primary_field]])) && (($maxlevel>$level+1) || ($maxlevel==0)))
            {
               
$this->makeBranch($item[$this->primary_field], $level+1, $maxlevel);
            }
        }
    }
}

function
chainCMP($a,$b)
{
    if(
$a[$a['key']] == $b[$b['key']])
    {
        return
0;
    }
    return(
$a[$a['key']]<$b[$b['key']])?-1:1;
}

?>

sreid at sea-to-sky dot net (08-Jan-2004 04:22)

As the manual says, "If two members compare as equal, their order in the sorted array is undefined." This means that the sort used is not "stable" and may change the order of elements that compare equal.

Sometimes you really do need a stable sort. For example, if you sort a list by one field, then sort it again by another field, but don't want to lose the ordering from the previous field. In that case it is better to use usort with a comparison function that takes both fields into account, but if you can't do that then use the function below. It is a merge sort, which is guaranteed O(n*log(n)) complexity, which means it stays reasonably fast even when you use larger lists (unlike bubblesort and insertion sort, which are O(n^2)).

<?php
function mergesort(&$array, $cmp_function = 'strcmp') {
   
// Arrays of size < 2 require no action.
   
if (count($array) < 2) return;
   
// Split the array in half
   
$halfway = count($array) / 2;
   
$array1 = array_slice($array, 0, $halfway);
   
$array2 = array_slice($array, $halfway);
   
// Recurse to sort the two halves
   
mergesort($array1, $cmp_function);
   
mergesort($array2, $cmp_function);
   
// If all of $array1 is <= all of $array2, just append them.
   
if (call_user_func($cmp_function, end($array1), $array2[0]) < 1) {
       
$array = array_merge($array1, $array2);
        return;
    }
   
// Merge the two sorted arrays into a single sorted array
   
$array = array();
   
$ptr1 = $ptr2 = 0;
    while (
$ptr1 < count($array1) && $ptr2 < count($array2)) {
        if (
call_user_func($cmp_function, $array1[$ptr1], $array2[$ptr2]) < 1) {
           
$array[] = $array1[$ptr1++];
        }
        else {
           
$array[] = $array2[$ptr2++];
        }
    }
   
// Merge the remainder
   
while ($ptr1 < count($array1)) $array[] = $array1[$ptr1++];
    while (
$ptr2 < count($array2)) $array[] = $array2[$ptr2++];
    return;
}
?>

webmaster at zeroweb dot org (20-Dec-2003 11:05)

Needed a quick, fairly uncluttered way of sorting an array of objects by a certain object attribute, so here's what I came up with. Uses one global array and usort(). Also accepts an optional sort direction argument (CSORT_ASC = sort ascending, CSORT_DESC = sort descending). Use it like this:

(assuming $myarray is your array, "index" is the attribute you want to sort by, and you want to sort in descending order)

      csort($myarray, "index", CSORT_DESC);

Hope this is of use to someone. Probably a better way to pull this off, but this works alright.

<?php
define
("CSORT_ASC",     1);
define("CSORT_DESC",     -1);

function
csort_cmp(&$a, &$b)
{
    global
$csort_cmp;

    if (
$a->$csort_cmp['key'] > $b->$csort_cmp['key'])
        return
$csort_cmp['direction'];

    if (
$a->$csort_cmp['key'] < $b->$csort_cmp['key'])
        return -
1 * $csort_cmp['direction'];

    return
0;
}

function
csort(&$a, $k, $sort_direction=CSORT_ASC)
{
    global
$csort_cmp;

   
$csort_cmp = array(
       
'key'           => $k,
       
'direction'     => $sort_direction
   
);

   
usort($a, "csort_cmp");

    unset(
$csort_cmp);
}
?>

kristen at ccshoreline dot org (22-Nov-2003 08:39)

I have a class with a bunch of functions that work with an SQL database. I am working with calendar dates that occur more than once (like once a week for 2 months), so I have to generate the date in php after the SQL. But I wanted to sort the events based on the date, so I tried using usort, but was unable to get it to work, because it didn't think that my sorting function was defined (even though it was in the same class). I have a separate class to store the data, that has a variable called Start which is a PHP date object.

So here is how I got it to work. First I created a temporary function, that returned the value of a string comparison of the timestamps for the dates. Then I used that temporary function for the usort. Enjoy.

<?php
$tempfunction
= create_function('$event1,$event2',
       
'return strcmp($event1->Start[0],$event2->Start[0]);');
usort($data,$tempfunction);
?>

skrebbel at operamail dot com (27-Mar-2003 09:59)

here's another recursive multisort, however a clean and fast one that is class-based (but works as well outside classes) and does not uglify your global namespace at all. note that strnatcmp is used, but one could use something else of course.

btw, for arrays in which the rows/columns are 'swapped', use array_multisort().

<?php
class Banana {
    var
$aData;//the array we want to sort.
   
var $aSortkeys;//the order in which we want the array to be sorted.
   
function _sortcmp($a, $b, $i=0) {
       
$r = strnatcmp($a[$this->aSortkeys[$i]],$b[$this->aSortkeys[$i]]);
        if(
$r==0) {
           
$i++;
            if (
$this->aSortkeys[$i]) $r = $this->_sortcmp($a, $b, $i+1);
        }
        return
$r;
    }
    function
sort() {
        if(
count($this->aSortkeys)) {
           
usort($this->aData,array($this,"_sortcmp"));
        }
    }
}
$B = new Banana;
$B->aData = array(
    array(
"name" => "hank", "headsize" => "big", "age" => 32),
    array(
"name" => "frank", "headsize" => "huge", "age" => 36)
);
$B->aSortkeys = array("age","name");
$B->sort();

?>
sorry for the ugly indenting, but i couldn't get it any better in this note adder thing.

steveNO_SPAM at AXE_MEcontentwatch dot com (31-Dec-2002 10:11)

The sort functions do nothing if identical keys exist.  Of course, you shouldn't have identical keys anyway, but this just might save someone else the oodles of time it took me to figure out while using multi-dimentional arrays:

<?php
class myArticleList {
// ... //
 
function &getList () {

   
// works
       
$a = array (
                  
"articleList1" => array ( "2", "3" ),
                  
"articleList2" => array ( "3" , "4")
                 );
   
usort( $a, array( $this, "compareByTitle") );
     
   
// doesn't work
       
$b = array (
                  
"articleList" => array ( "2", "3" ),
                  
"articleList" => array ( "3" , "4")
                 );
   
usort( $b, array( $this, "compareByTitle") );
  }

  function
compareByTitle( $a, $b ) {
 
// ... //
 
}
}
?>

mharrodine AT blue yonder DOT co-uk (12-Dec-2002 12:46)

I like to define my arrays to look like tables in a database or spreadsheet as follows (it looks tidy is the only reason!):

Row(s)  Column(s) ------------->
   |        $array[0] = array("1", "2","3");
   |        $array[1] = array("1", "2","3");
   \/       $array[2] = array("1", "2","3");

This "array of arrays" seems to behave differently to normal associative or multi-dimension arrays when sorting but using franky's routine....

<?php
function cmp ($a, $b)
{  
global
$w_o;
if (
$a[$w_o] == $b[$w_o]) return 0;
return (
$a[$w_o] < $b[$w_o]) ? -1 : 1;
}
?>

...you simply specify the column you want to sort by defining $w_o and call "usort($my_array,"cmp");". This might seem obvious to some people but wasn't to me and I hope this helps others in the same situation. Thanks....

jfren484 AT hotmail DOT com (25-Oct-2002 12:37)

If you've used ADO before, you may have used the Sort property on a recordset.  It's very powerful - you can add a nice ORDER BY clause after getting the recordset from the database.  It's especially helpful if you want to show a list on a web page and make the column headings links that cause the list to resort on that column.

I wanted to do the same thing with mysql recordsets, but it looks like you have to have the ORDER BY in your query.  I re-worked the example from johan_land at yahoo dot com above for sorting multidimensional arrays.  When I get a mysql recordset, I create an array with all of the records like this:

<?php
$aaRows
[]    = array();
if (
mysql_num_rows($rsRows) > 0)
    while (
$aRow = mysql_fetch_array($rsRows, MYSQL_ASSOC))
       
$aaRows[]    = $aRow;
?>

At this point $aaRows is an array of arrays - it's a numeric-indexed array containing records from the recordset, which themselves are associative arrays.  The following code takes the array of records as the first parameter, and an array of fields to sort - each field is an associative array, where 'name' is the db field name, and 'dir' is the direction to sort.  If dir is 'DESC' (case-insensitive), it will sort descending.  Any other value (including not setting one) will cause it to sort ascending.

<?php
function sortRows(&$a_aaRows, $a_aaSortCriteria)
{
    GLOBAL   
$g_aaSortArray;

    function
compare($a_aRow1, $a_aRow2, $a_lField = 0)
    {
        GLOBAL   
$g_aaSortArray;

       
$lCompareVal    = 0;

        if (
$a_lField < count($g_aaSortArray))
        {
           
$sSortFieldName    = $g_aaSortArray[$a_lField]['name'];
           
$sSortFieldDir    = $g_aaSortArray[$a_lField]['dir'];

           
$vValue1    = eval('return $a_aRow1[' . $sSortFieldName . '];');
           
$vValue2    = eval('return $a_aRow2[' . $sSortFieldName . '];');

            if (
$vValue1 == $vValue2)
               
$lCompareVal    = compare($a_aRow1, $a_aRow2, $a_lField + 1);
            else
            {
               
$lCompareVal    =    $vValue1 > $vValue2 ? 1 : -1;
                if (
strtolower(substr($sSortFieldDir, 0, 4)) == 'desc')
                   
$lCompareVal    = -$lCompareVal;
            }
        }

        return
$lCompareVal;
    }

   
$g_aaSortArray    = $a_aaSortCriteria;
   
usort($a_aaRows, 'compare');
}
?>

When I call it it looks something like this:

<?php
sortRows
($aaRows, array(array('name' => 'STATE', 'dir' => 'ASC'), array('name' => 'CITY', 'dir' => 'DESC')));
?>

mkr at binarywerks dot dk (20-Sep-2002 05:29)

If you want to sort an array according to another array acting as a priority list, you can use this function.

<?php
function listcmp($a, $b)
{
  global
$order;

  foreach(
$order as $key => $value)
    {
      if(
$a==$value)
        {
          return
0;
          break;
        }

      if(
$b==$value)
        {
          return
1;
          break;
        }
    }
}

$order[0] = "first";
$order[1] = "second";
$order[2] = "third";

$array[0] = "second";
$array[1] = "first";
$array[2] = "third";
$array[3] = "fourth";
$array[4] = "second";
$array[5] = "first";
$array[6] = "second";

usort($array, "listcmp");

print_r($array);
?>

simen at NO_SPAM_AT_ALLbleed dot no (06-Aug-2002 09:16)

To sort a list of objects either ascending (a) or descending (d) using key use the function below for comparison.

<?php
function property_sort($oa, $ob) {
    global
$sort_key;
    global
$sort_dir;

   
$a = strtolower($oa->$sort_key);
   
$b = strtolower($ob->$sort_key);

    if (
$a == $b) {
        return
0;
    } else if ((
$a > $b && $sort_dir == "a") || ($a < $b && $sort_dir == "d")) {
        return
1;
    } else {
        return -
1;
    }
}
?>

prozac at iguanasoft dot com (15-Jul-2002 01:55)

Here is a simple example of converting a timestamp date("U") into a date. This sorts by that day and then by string value alphabetically.

I hope it saves someone some time... Happy PHP'in!

<?php
//data to sort
$shared[0]["page_id"] = "2025731470";
$shared[1]["page_id"] = "2025731450";
$shared[2]["page_id"] = "1025731456";
$shared[3]["page_id"] = "1025731460";
$shared[0]["username"] = "larry";
$shared[1]["username"] = "alvin";
$shared[2]["username"] = "garth";
$shared[3]["username"] = "harvy";

//function to convert timestamp to date
function convert_timestamp($timestamp){
   
$limit=date("U");
   
$limiting=$timestamp-$limit;
    return
date ("Ymd", mktime (0,0,$limiting));
}
//comparison function
function cmp ($a, $b) {
   
$l=convert_timestamp($a["page_id"]);
   
$k=convert_timestamp($b["page_id"]);
    if(
$k==$l){
        return
strcmp($a["username"], $b["username"]);
    }else{
        return
strcmp($k, $l);
    }
}

//sort array
usort($shared, "cmp");

//display sorted info
while (list ($key, $value) = each ($shared)) {
    echo
"\$shared[$key]: ";
    echo
$value["page_id"];
    echo
" username: ";
    echo
$value["username"];
    echo
"<break_tag>";
}
?>

This will output:
$shared[0]: 2025731450   username: alvin
$shared[1]: 2025731470   username: larry
$shared[2]: 1025731456   username: garth
$shared[3]: 1025731460   username: harvy

alex at netflex dot nl (02-Jul-2002 12:10)

This function will sort on more then one values, test and have fun

<pre>
<?php

  $array
[0]['name'] = "a";
 
$array[0]['id'] = 3;

 
$array[1]['name'] = "a";
 
$array[1]['id'] = 2;

 
$array[2]['name'] = "a";
 
$array[2]['id'] = 5;

 
$array[3]['name'] = "b";
 
$array[3]['id'] = 8;

 
$array[4]['name'] = "b";
 
$array[4]['id'] = 1;

 
$array[5]['name'] = "b";
 
$array[5]['id'] = 0;

 
$array[6]['name'] = "c";
 
$array[6]['id'] = 5;

 
$array[7]['name'] = "c";
 
$array[7]['id'] = 7;

 
$array[8]['name'] = "c";
 
$array[8]['id'] = 3;

 
print_r($array);

 
$sort_array[0]['name'] = "name";
 
$sort_array[0]['sort'] = "ASC";
 
$sort_array[0]['case'] = TRUE;

 
$sort_array[1]['name'] = "id";
 
$sort_array[1]['case'] = FALSE;

 
sortx($array, $sort_array);

 
print_r($array);

  function
sortx(&$array, $sort = array()) {
   
$function = '';
    while (list(
$key) = each($sort)) {
      if (isset(
$sort[$key]['case'])&&($sort[$key]['case'] == TRUE)) {
       
$function .= 'if (strtolower($a["' . $sort[$key]['name'] . '"])<>strtolower($b["' . $sort[$key]['name'] . '"])) { return (strtolower($a["' . $sort[$key]['name'] . '"]) ';
      } else {
       
$function .= 'if ($a["' . $sort[$key]['name'] . '"]<>$b["' . $sort[$key]['name'] . '"]) { return ($a["' . $sort[$key]['name'] . '"] ';
      }
      if (isset(
$sort[$key]['sort'])&&($sort[$key]['sort'] == "DESC")) {
       
$function .= '<';
      } else {
       
$function .= '>';
      }
      if (isset(
$sort[$key]['case'])&&($sort[$key]['case'] == TRUE)) {
       
$function .= ' strtolower($b["' . $sort[$key]['name'] . '"])) ? 1 : -1; } else';
      } else {
       
$function .= ' $b["' . $sort[$key]['name'] . '"]) ? 1 : -1; } else';
      }
    }
   
$function .= ' { return 0; }';
   
usort($array, create_function('$a, $b', $function));
  }

?>
</pre>

graham at irwin dot org (16-Jan-2002 04:28)

Example 3 above does not work with 4.0.4pl1, unless you write the uasort line as follows:
uasort($a, array ($a[0], "cmp_obj"));

(I assume any instance of the object: a[0] or a[1] or a[2] would work as well)

It does not work at all with associative arrays of objects.

xnoguer at rezebra dot com (25-Sep-2001 07:48)

just for debugging purposes, usort does not complain if its argument function is not defined, i.e.:

<?php usort($my_array,"non existant function"); ?>

will not do anything...

josh at wintelcom dot net (25-Aug-2001 02:58)

This lets you sort an associative multi-dimensional array by multiple key/field names.  Much similiar to the SQL clause ORDER BY.  Enjoy.

<?php
function cmp ($a, $b) {

   
// Populate this array with your values...
    // Below is the SQL equivalent of
    // select * from blah ORDER BY date desc, type asc, name asc

   
$vals = array(
       
'date' => 'd',
       
'type' => 'a',
       
'name' => 'a'
   
);

    while(list(
$key, $val) = each($vals)) {

        if(
$val == "d") {
            if (
$a["$key"] > $b["$key"]) {
                return -
1;
            }
            if (
$a["$key"] < $b["$key"]) {
                return
1;
            }
        }

        if(
$val == "a") {
            if (
$a["$key"] < $b["$key"]) {
                return -
1;
            }
            if(
$a["$key"] > $b["$key"]) {
                return
1;
            }
        }

    }

}
?>

franky at iname dot com (17-Jul-2001 11:08)

For sort multi-array by specific index

<?php
function cmp ($a, $b)
{  
 global
$w_o;
 if (
$a[$w_o] == $b[$w_o]) return 0;
 return (
$a[$w_o] < $b[$w_o]) ? -1 : 1;
}
# the index is the second element of
# each row

$w_o =1;
usort($my_arry_info,"cmp");
?>

johan_land at yahoo dot com (29-Jun-2001 01:23)

These functions will sort an array by more than one element. The elements to sort by is specified in $sortArr. If you eg. want to sort by $destArr[]["sortBy2"][0] you add '["sortBy2"][0]' to $sortArr. Use it as much as you want!! If you modify it, please let me know...

<?php
//The functions
function compare($a, $b) {
    return
cmpRec(0, $a, $b);
}

function
cmpRec($i, $a, $b) {
    global
$sortArr;
    if(
$i == sizeof($sortArr)) {
        return
0;
    }
   
$avalue = '$avalue = $a'.$sortArr[$i].';';
   
$bvalue = '$bvalue = $b'.$sortArr[$i].';';
    eval(
$avalue);
    eval(
$bvalue);
        if(
$avalue == $bvalue) {
        return
cmpRec($i+1, $a, $b);
    } else {
        return (
$avalue > $bvalue) ? (1) : (-1);
    }
}

//For testing the functions
$destArr = array( array( "sortBy1" => 2, "sortBy2" => array( "Fish", "eat seafood" )), array( "sortBy1" => 1, "sortBy2" => array( "Lions", "eat everything" )), array( "sortBy1" => 1, "sortBy2" => array( "Bird", "eat birdfood" )) );
$sortArr = array( '["sortBy1"]', '["sortBy2"][0]' );
print_r($destArr);
usort($destArr, "compare");
reset($destArr);
print_r($destArr);
?>

bo at erichsen dot com (20-Mar-2001 01:16)

when using usort to refer to a function inside a class i have succesfully used:

<?php usort($myarray,array($this,"cmp")); ?>

derek at luddite dot net (19-Sep-2000 07:35)

Needed a date sort and I didn't know if one was available so I wrote one. Maybe it'll help someone:

<?php
function DateSort($a,$b,$d="-") {
    if (
$a == $b) {
        return
0;
    } else { 
//Convert into dates and compare
       
list($am,$ad,$ay)=split($d,$a);
        list(
$bm,$bd,$by)=split($d,$b);
        if (
mktime(0,0,0,$am,$ad,$ay) < mktime(0,0,0,$bm,$bd,$by)) {
            return -
1;
        } else {
            return
1;
        }
    }
}
?>

$d is the delimeter