直接排序法

#include <iostream>
using namespace std;


void sort(int arr[], int n){

    for (int i = 0; i < n-1; i++){
        int min_j = i;
        for (int j = i+1; j < n; j++){
            if (arr[j] < arr[min_j]){
                min_j = j;
            }
        }

        // swap
        int tmp = arr[i];
        arr[i] = arr[min_j];
        arr[min_j] = tmp;
		
		cout << endl;
		for (int i = 0; i < 8; i++){
		 cout << arr[i]<< " " ;
		}
    }
}

int main()
{
   cout << "Hello World";
   int arr[] = {8, 3, 2, 1, 7, 4, 6, 5};
    sort(arr, 8);
	
	 cout <<endl;

	for (int i = 0; i < 8; i++){
		 cout << arr[i]<< " " ;
	}
	   
   return 0;
}