Selection Sort

Koding :

#include <iostream>
//JUDUL : SELECTION SORT
//OLEH : RIZKY SYAH GUMELAR
//TANGGAL : 11 APRIL 2022
//DESKRIPSI :
using namespace std;
 
void selectionSort (int arr[], int n)
{
    int i;
    for (i=0; i<n; i++)
        cout << arr[i] << "\t";
 
    cout << "\n";
}
 
int main()
{
    int arr[] = {10, 13, 9, 27, 21, 14};
    int n = 6;
 
    cout << "Array sebelum diurutkan : \n";
    selectionSort(arr, n);
 
    int i, j, nilaiMin, temp;
 
    for (i=0; i<n-1; i++){
        nilaiMin = i;
        for(j=i+1; j<n; j++){
            if(arr[j] < arr[nilaiMin])
                nilaiMin = j;
        }
        temp = arr[nilaiMin];
        arr[nilaiMin] = arr[i];
        arr[i] = temp;
    }
 
    cout << "Array sesduah diurutkan : \n";
    selectionSort(arr, n);
    return 0;
}
 

Screenshot hasil: