Cyclical indexing

let phrases = [
    "I love you",
    "a little",
    "a lot",
    "passionately",
    "madly",
    "not at all"
]

return phrases[(nbPetals - 1) % phrases.length];
}

The code (nbPetals - 1) % phrases.length is used to determine which phrase to return. Here's what it does:

1. nbPetals - 1: We subtract 1 because arrays start counting from 0. For example, if we have 7 petals, without the - 1, we would try to access phrases[7], which doesn't exist because phrases only has 6 elements (0 through 5).

2. ... % phrases.length: The modulus operator % gives the remainder of the division of two numbers. In this case, we're dividing the number of petals (minus 1) by the total number of phrases. This allows us to "wrap around" to the beginning of the phrases if we have more than 6 petals. For example, if we have 7 petals, 7 - 1 gives us 6, and 6 % 6 gives us 0, so we return the first phrase ("I love you").

Note:
In many mathematical and programming contexts, the modulus operation is a standard technique used to cycle or wrap around within a given range of numbers.

For example, if you have a list of 6 items and you want to find which item corresponds to the 8th position, you can't just directly index the 8th item because there are only 6 items. If you want to wrap around back to the start of the list when you reach the end, you can use the modulus operation.

The reason why modulus is useful here is because it gives the remainder of a division operation. When you divide 8 by 6, the quotient is 1 and the remainder is 2, meaning you've gone around the list 1 full time and are now at the 2nd item in the next round. This is why 8 % 6 gives 2.