source: liacs/pm/tentamen_oef/opgave1.cc@ 288

#include <iostream>

using namespace std;


int kleinste( const int a[], const int i, const int n ) {
        int tmpKleinste = i;
        for(int ctr =(i+1); ctr < n; ctr++ ) {
                if( a[ctr] < a[tmpKleinste] ) {
                        tmpKleinste = ctr;
                }
        }
        return tmpKleinste;
}

void verschuif( int a[], const int i, const int j ) {
        const int tmpGetal = a[j];
        for(int ctr = j; ctr > i; ctr--) {
                a[ctr] = a[ctr-1];
        }
        a[i] = tmpGetal;
}

void sorteer( int a[], const int n ) {
        int tmpKleinste = 0;
        for(int ctr = 0; ctr < n; ctr++) {
                tmpKleinste = kleinste( a, ctr, n );
                cout << "Kleinste = " << tmpKleinste <<endl;
                verschuif( a ,ctr, tmpKleinste );
        }
}

int const n = 3;

void groter( int a[][n], const int X, const int m ) {
cout << n;
}

int main( ) {
/*      int a[6] = {2,4,1,5,3,6};
        sorteer( a, 6 );
        for(int ctr=0; ctr< 6; ctr++) {
                cout << a[ctr] <<endl;
        }
*/

int a[3][3] = { { 3, 5, 7 } , { 1, 2, 5 } , { 7, 7, 11} };
groter(a, 4, 1);

} //end main