[C/C++] Example / Ordering - Descending Algorithms

//
//  main.cpp
//  Test-003
//
//  Created by gchoi on 2014. 5. 8..
//  Copyright (c) 2014년 gchoi. All rights reserved.
//

#include <iostream>

using namespace std;

int main(int argc, const char * argv[])
{
    int num[] = {88, 67, 77, 93, 23, 51, 32, 33, 76, 52};
    int nElem = sizeof(num)/sizeof(int);
    int myMin;
    int tmp, dummy;

    tmp = 0;
   
    for(int i = 0 ; i < nElem - 1 ; i++) {
        myMin = num[i];
       
        tmp = 0;
        for(int j = i+1 ; j < nElem ; j++) {
            // find the minimum
            if(myMin > num[j]) {
                myMin = num[j];
                tmp = j;
            }
        }
       
        if(tmp != 0) {
            dummy = num[i];
            num[i] = num[tmp];
            num[tmp] = dummy;
        }
       
    }
   
    for(int i = 0 ; i < nElem ; i++) {
        cout << *(num + i) << endl;
    }

    return 0;
}