Selection Sort

// Ichlalsul Bulqiah
// 190535646047

#include <iostream>
using namespace std;

void selectionSort(int *arr, int topIdx, int bottomIdx=0) {
    
    if (bottomIdx != topIdx) {
        for (int i=bottomIdx+1; i<=topIdx; i++) {
            if (arr[i] < arr[bottomIdx]) {
                int tmp = arr[i];
                arr[i] = arr[bottomIdx];
                arr[bottomIdx] = tmp;
            }
        }
        selectionSort(arr, topIdx, ++bottomIdx);
    }
}

int main() {
    int arr[] = {8, 7, 2, 3, 6, 1}; // silahkan rubah untuk mencoba nilai yang lain
    int arrLength = sizeof(arr)/sizeof(arr[0]);
    selectionSort(arr, arrLength-1);
    
    for (int i=0; i<arrLength; i++) {
        cout << arr[i] << " ";
    }
    
    return 0;
}