Selection Sort - Sắp Xếp Chọn - Code Lean

Có thể bạn quan tâm

void selectionSort(int arr[], int n)

{

int i, j, min_index;

// One by one move boundary of unsorted subarray

for (i = 0; i < n-1; i++)

{

// Find the minimum element in unsorted array

min_index = i;

for (j = i+1; j < n; j++)

if (arr[j] < arr[min_index])

min_index = j;

// Swap the found minimum element with the first element

swap(&arr[min_index], &arr[i]);

}