You do not have permission to edit this page, for the following reason:
You can view and copy the source of this page.
Templates used on this page:
Return to Selection Sort Program.
Complexity and no. of swaps required
<syntaxhighlight lang="c" name="selectionsort_rec">
void selection_sort(int *a, int n) {
GATECSE if(n == 1)
return;
int big = 0, i;
for(i = 1; i < n; i++)
if(a[i] > a[big])
big = i;
/*swap a[n-1] and a[big]*/
int temp = a[n-1];
a[n-1] = a[big];
a[big] = temp;
selection_sort(a, n-1);
}
int main()
{
int a[100], i, n;
printf("Enter n:");
scanf("%d", &n);
printf("Enter numbers: ");
for(i = 0; i < n; i++)
scanf("%d", &a[i]);
selection_sort(a, n);
printf("Printing sorted:\n");
for(i = 0; i < n; i++)
printf("%d ", a[i]);
return 0;
}
</syntaxhighlight>