用递归思想写冒泡排序

用递归思想写冒泡排序

# define _CRT_SECURE_NO_WARNINGS
# include<stdio.h>
# include<stdlib.h>
# define N 5
int main(void){
int a[N], i, j;


int selection_sort(int a[], int n);


printf("pls enter the numbers:");
for (i = 0; i<5; i++){
scanf("%d", &a[i]);
}
selection_sort(a, i);
printf("The sorted numbers are :");
for (j = 0; j < i; j++)
printf("  %d", a[j]);


system("pause");
return 0;


}


int selection_sort(int a[], int i)
{
int temp, n;
for (n = 0; n<i-1; n++){
if (a[n] > a[n + 1]){
temp = a[n + 1];
a[n + 1] = a[n];
a[n] = temp;
}
}
if (i <= 1)
return 1;
else
return selection_sort(a, i - 1);


}