[Jumping into C++] What is Chapter 10, Exercise 1 asking?

[Tesp]

It said:

Turn the code that we wrote for insertionSort into an insertionSort function that works for any sized array.

Except that the insertionSort shown in that same chapter already does that. Have a look:

void sort (int array[], int size)
{
    for ( int i = 0; i < size; i++ )
    {
    int index = findSmallestRemainingElement( array, size, i );


    swap( array, i, index );
    }


}

The code of the findSmallestRemainingElement and swap functions were shown in the same few pages, but this already looks like it can handle an array of any size. At least, within the numbers the int type can handle.

I could make it handle more by having the array and size args be unsigned longs instead, but thats just too easy (and the chapter wasnt even about what the various types do).

Was this a mistake, or am I missing something, here?

[whiteflags]

The code you are referencing looks like selection sort. A proper insertion sort doesn't necessarily use a swap.

[Tesp]

Though, in the book, the sort itself was specifically referred to as an insertion sort (which made things confusing). :/ I'll read up some to better grasp the difference, to see what I can do for this assignment.