6.4. Array Algorithms (FRQs)ΒΆ

In this lesson, you will study different Free Response Questions and responses that develop algorithms using arrays.

Here are some common algorithms that you should be familiar with for the AP CS A exam:

Here are two common array traversal loops that can be used for these algorithms:

for (int value : array)
{
    if (value ....)
        ...
}

for(int i=0; i < array.length; i++)
{
   if (array[i] ....)
       ...
}

coding exercise Coding Exercise

Here is an example that finds the minimum element in an array. Try it in the Java visualizer. Can you change it to find the maximum element instead? Can you also compute the average of the elements?

coding exercise Coding Exercise

Here is another example that rotates the elements to the left. Note that you need to use an indexed loop for this because you need to change the array and access two elements at different indices. Try it in the Java visualizer. Can you change it to rotate the elements to the right instead?

We encourage you to work in pairs or groups to tackle the following challenging FRQ problems and take them one step at a time. These will get easier with practice!

You have attempted of activities on this page
Next Section - 6.4.1. Free Response - Horse Barn A