Question about sorting an array in reverse.

Hi there, Alejandro Hernandez! Even though this is not an associative array, it does have "keys". You may also know them as indexes. It's looking for the answer arsort. This would sort the array in reverse, but the big difference here is that it maintains the key/index association. Even though "Yellow" would appear at the beginning of the array, it would still maintain the index of 2.

Here's some example code:

<?php

$fruit_basket = ['apples', 'bananas', 'kiwi', 'pineapple'];
arsort($fruit_basket);
echo "\nMaintaining keys:\n";

foreach($fruit_basket as $key=>$value) {
    echo "$value is at an index of $key\n";
}

rsort($fruit_basket);
echo "\nNot maintaining keys:\n";

foreach($fruit_basket as $key=>$value) {
    echo "$value is at an index of $key\n";
}

The output is:

Maintaining keys:
pineapple is at an index of 3
kiwi is at an index of 2
bananas is at an index of 1
apples is at an index of 0

Not maintaining keys:
pineapple is at an index of 0
kiwi is at an index of 1
bananas is at an index of 2
apples is at an index of 3

Notice that they are printed out in the same order, but the "keys" or indexes have changed in the second one. Either rsort or arsort is a correct answer for this question, but since rsort is not available, the only correct answer left is arsort. I think the biggest confusion is between normal arrays and associative arrays. A normal indexed array is pretty much exactly like an associative array, except that the keys aren't anything we define ourselves. The PHP interpreter takes our list of items, creates a range of integers such that the "keys"/indexes start at 0 and go up to the length - 1 of our list of items. In associative arrays, we name the keys ourselves.

Hope this helps!