one-dimensional array sorting can be sorted by some method processes, such as Asort, Ksort, and relatively simple. How does the order of two-dimensional arrays come true? Use Array_multisort and Usort to implement
For example, like the following array: code as follows: $users = Array ( Array (' name ' => ' Tom ', ' age ' =>) , ARRA Y (' name ' => ' Anny ', ' age ' =>] , array (' name ' => ' Jack ', ' age ' => 22)); Want to sort by age from small to large. The author has collated two methods to come out and share to everybody. 1, using Array_multisort Use this method, will be more trouble, to extract the age to store in a one-dimensional array, and then in ascending order of the year. The specific code is as follows: code as follows: $ages = Array (); foreach ($users as $user) { $ages [] = $user [' Age '];} Array_multisort ($ages, SORT_ASC, $users); Execution, $users is a sorted array, can be printed out to see. If you need to first in ascending order by age, and then sorted by name in ascending order, the method above, is to extract an array of names, the final sort method to call: code as follows: Array_multisort ($ages, SORT_ASC, $names, Sort_ ASC, $users); 2, using Usort The biggest advantage of using this method is that you can customize some of the more complex sorting methods. For example, by the length of the name descending order: The code is as follows: Usort ($users, function ($a, $b) { $al = strlen ($a [' NA Me ']); $BL = strlen ($b [' name ']); if ($al = = $BL) return 0; return ($al > $bl) -1:1; }); The anonymous function is used here and can be extracted separately if necessary. Where $a, $b can be understood as the elements under the $users array, you can directly index the name value, and calculate the length, and then compare the length can be. I prefer the second approach because less steps are taken to extract the sorted content into a one-dimensional array, and the sorting method is more flexible.