Preserve key order (stable sort) when sorting with PHP’s uasort

by

Since PHP does not support stable sort after PHP 4.1.0, you need to write your own function.

This seems to do what you’re asking: http://www.php.net/manual/en/function.usort.php#38827

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;
}
?>

Also, you may find this forum thread interesting.

More Related Contents:

  1. Group array by subarray values
  2. How to get popular keywords in an array
  3. How can I sort arrays and data in PHP?
  4. How to sort an array of associative arrays by value of a given key in PHP?
  5. Sort array of objects by object fields
  6. Sort multidimensional array by multiple columns
  7. PHP Sort a multidimensional array by element containing Y-m-d H:i:s date
  8. Sorting an associative array in PHP [duplicate]
  9. Sorting a php array of arrays by custom order
  10. How do I sort a multidimensional array by one of the fields of the inner array in PHP? [duplicate]
  11. Sort array of objects by one property
  12. PHP array multiple sort – by value then by key?
  13. String with array structure to Array [duplicate]
  14. Sort an array by a child array’s value in PHP
  15. PHP Get Highest Value from Array
  16. scandir() to sort by date modified
  17. PHP order array by date? [duplicate]
  18. Using usort in php with a class private function
  19. Sort Object in PHP
  20. Algorithm to get all possible string combinations from array up to certain length
  21. Sort multidimensional array by date column, then use other column values if dates are the same
  22. How to GROUP BY and SUM PHP Array? [duplicate]
  23. Grouping arrays in PHP
  24. Sort a flat, associative array by numeric values, then by non-numeric keys
  25. Sort an array of associative arrays by column value
  26. Custom key-sort a flat associative based on another array
  27. Sort array by value alphabetically php
  28. How to have a stable sort in PHP with arsort()?
  29. How do I move an array element with a known key to the end of an array in PHP?
  30. Sort array by numeric keys

Leave a Comment