Recursive Sort Example, C++ (clang)

Language: Layout:

// Example from Lecture 6 in class on recursive functions

#include <iostream>
#include <stdlib.h> // rand srand
using namespace std;

void recursiveSort(int *array, int n) 
{
    for (int i=0; i<10-n; i++) cout << "   ";
    cout << "Entering into recursiveSort:  n = " << n << "Address of array = " << array << endl;
    if (n==1) {
        return;
    }
    // find smallest thing in the array, and put it first
    int smallIndex = 0; int smallValue = array[0];
    for (int i=1; i<n; i++) {
        if (array[i] < smallValue) {
            smallValue = array[i];
            smallIndex = i;
        }   
    }
    // swap smallest value with first value
    array[smallIndex] = array[0];
    array[0] = smallValue;
    // make recursive call
    array++;
    n -= 1;
    recursiveSort(array,n);
    for (int i=0; i<10-n; i++) cout << "   ";
    cout << "Returning from recursiveSort: n = " << n << endl;
    return;
}

int main()
{
    int n, *array;
    cout << "Enter n: ";
    cin >> n;
    // create array of that size
    array = new int[n];
    cout << endl << "n = " << n << endl << endl;
    srand(1111);
    cout << "Initial array = ";
    for (int i=0; i<n; i++) {
        array[i] = rand() % 100;
        cout << array[i] << " ";
    }
    cout << endl;
    recursiveSort(array, n);
    cout << "Sorted array = ";
    for (int i=0; i<n; i++) {
        cout << array[i] << " ";
    }
    cout << endl;  
    return 0;
}

Show compiler warnings [ + ] Compiler args [ - ] Show input
Compilation time: 0.72 sec, absolute running time: 0.12 sec, cpu time: 0.06 sec, memory peak: 3 Mb, absolute service time: 0,86 sec