选择排序算法

选择排序

static void extracted(int *arr, int i, int min) {
    int temp = arr[i];
    arr[i]=arr[min];
    arr[min]=temp;
}

void SelectionSort(int arr[],int n){
    for (int i =0; i<n-1; i++) {
        int min =i;
        for (int j = i+1; j<n; j++) {
            if (arr[j]<arr[min]) {
                min=j;
            }
        }
        extracted(arr, i, min);
    }
}

int main(void){
    int array[]= {1,2,8,4,9,6,7};
    SelectionSort(array, 7);  //调用SelectionSort函数，进行比较
    cout << endl;  //换行
    cout << "由小到大的顺序排列后： " << endl;
    for (int i = 0; i < 7; i++)
    {
        cout << "Array" << "[" << i << "]" << " = " << array[i] << endl;
    }
    return 0;
}