(PHP 4, PHP 5, PHP 7)
sort — Sort an array
&$array
, int $flags
= SORT_REGULAR
) : boolThis function sorts an array. Elements will be arranged from lowest to highest when this function has completed.
Notă:
Dacă în rezultatul comparației doi membri sunt egali, ordinea lor relativă în tabloul sortat nu este definită.
array
The input array.
flags
The optional second parameter flags
may be used to modify the sorting behavior using these values:
Sorting type flags:
SORT_REGULAR
- compare items normally;
the details are described in the comparison operators section
SORT_NUMERIC
- compare items numerically
SORT_STRING
- compare items as strings
SORT_LOCALE_STRING
- compare items as
strings, based on the current locale. It uses the locale,
which can be changed using setlocale()
SORT_NATURAL
- compare items as strings
using "natural ordering" like natsort()
SORT_FLAG_CASE
- can be combined
(bitwise OR) with
SORT_STRING
or
SORT_NATURAL
to sort strings case-insensitively
Întoarce valoarea true
în cazul
succesului sau false
în cazul eșecului.
Example #1 sort() example
<?php
$fruits = array("lemon", "orange", "banana", "apple");
sort($fruits);
foreach ($fruits as $key => $val) {
echo "fruits[" . $key . "] = " . $val . "\n";
}
?>
Exemplul de mai sus va afișa:
fruits[0] = apple fruits[1] = banana fruits[2] = lemon fruits[3] = orange
The fruits have been sorted in alphabetical order.
Example #2 sort() example using case-insensitive natural ordering
<?php
$fruits = array(
"Orange1", "orange2", "Orange3", "orange20"
);
sort($fruits, SORT_NATURAL | SORT_FLAG_CASE);
foreach ($fruits as $key => $val) {
echo "fruits[" . $key . "] = " . $val . "\n";
}
?>
Exemplul de mai sus va afișa:
fruits[0] = Orange1 fruits[1] = orange2 fruits[2] = Orange3 fruits[3] = orange20
The fruits have been sorted like natcasesort().
Notă: Această funcție atribuie chei noi elementelor din
array
. Ea va elimina cheile existente, care posibil au fost atribuite, în loc doar să rearanjeze cheile.
Notă: Like most PHP sorting functions, sort() uses an implementation of » Quicksort. The pivot is chosen in the middle of the partition resulting in an optimal time for already sorted arrays. This is however an implementation detail you shouldn't rely on.
Be careful when sorting arrays with mixed types values because
sort() can produce unexpected results,
if flags
is SORT_REGULAR
,