This question already has an answer here:
I have an array that is created like this:
$i = 0;
$files = array();
while ($file = mysql_fetch_array($query_files)) {
$files[$i] = array();
$files[$i] = $file;
$i++;
}
And I need to be able to sort the $files array based on each $file['name'] aka $files[$i]['name'].
How do I do this? Thanks!
</div>
Add ORDER BY NAME
to your query. Seriously. That's the fastest, memory safest and all around best way to do it. I'm not kidding. Further, you'd be telling the database to do something it is awesome at, whereas PHP is only OK at it. Finally, you have the option to index the name column of the DB while PHP offers no index.
If you absolutely must sort it yourself, then you need to use usort
.
// this example is almost a clone of something in the docs.
function cmp($a, $b)
{
return strcmp($a["name"], $b["name"]);
}
usort($files, "cmp");
Looks like a job for usort
usort($array, function ($a, $b) {
if ($a['name'] == $b['name']) {
return 0;
}
return $a['name'] < $b['name'] ? -1 : 1;
});