Can be used to swap the contents of two array entries, then the logic for the missing code is

Question

Assuming a method

```
int findMax(int array[ ], int last)
```

that returns the subscript of the largest value in the portion of an array whose elements are at 0 through last (inclusive), a recursive method for sorting in ascending order a portion of an array between 0 and last, inclusive, can be written as follows:

```
void rSort(int array[ ], int last)
{
if (last >= 1)
{
// Missing code
}
}

```
If a method

```
void swap(int array[ ], int pos1, int pos2)
```

A) findMax(array, array.length-1); rSort(array, array.length-1);
B) int p = findMax(array, array.length-1); rSort(array, p);
C) int p = findMax(array, last); swap(array, p, last); rSort(array, last-1);
D) rSort(array, last-1); int p = findMax(array, last); swap(array, p, last);

Answer 1

C) int p = findMax(array, last); swap(array, p, last); rSort(array, last-1);