Selection Sort

#include <iostream>
#include <stdio.h>
#include <cstdio>
#include "dbg.h"
using namespace std;

void selectSort(int R[], int len);


int main(int argc, char *argv[])
{
    int R[] = {1, 3, 2, 18, 3, 28, 23, 38, 7, 8};
    cout << "Before sorting = " << endl;
    dbg(R);
    int len = sizeof(R) / sizeof(R[0]);
    cout << "After sorting  = " << endl;
    selectSort(R, len);
    dbg(R);
    return 0;
}

void selectSort(int R[], int n)
{
    for (int i = 0; i < n - 1; i++)
    {
        int minIndex = i;
        // 1. 找到元素i右侧最小值
        for (int j = i + 1; j < n; j++)
        {
            minIndex = R[j] < R[minIndex] ? j  = minIndex;
            //if (R[j] < R[minIndex])
            //    minIndex = j;
        }
        // 2. 交换
        int temp = R[i];
        R[i] = R[minIndex];
        R[minIndex] = temp;
    }
}