到很多地方求助都没有结果,来这里碰碰运气,谢谢大佬了。#include<stdio.h>
void selection_sort(int* arr,int n)
{
int count=0,tmp;
for(int j=0;j<n-1-count;j++)
{
if(arr[j]>arr[j+1]){
tmp=arr[j];
arr[j]=arr[j+1];
arr[j+1]=tmp;
}}
count++;
if(count!=n-1)
selection_sort(arr,n);
else return;
}
int main()
{int n;
scanf("%d",&n);
int a[n]={0};
for(int i=0;i<n;i++)
scanf("%d",&a[i]);
selection_sort(a,n);
for(int k=0;k<n;k++)
printf("%d ",a[k]);
return 0;
}#include<stdio.h>
void selection_sort(int* arr,int n)
{
int count=0,tmp;
for(int j=0;j<n-1-count;j++)
{
if(arr[j]>arr[j+1]){
tmp=arr[j];
arr[j]=arr[j+1];
arr[j+1]=tmp;
}}
count++;
if(count!=n-1)
selection_sort(arr,n);
else return;
}
int main()
{int n;
scanf("%d",&n);
int a[n]={0};
for(int i=0;i<n;i++)
scanf("%d",&a[i]);
selection_sort(a,n);
for(int k=0;k<n;k++)
printf("%d ",a[k]);
return 0;
}
#include<stdio.h>
#include<math.h>
int quickerpower(int x,int n)
{
if(n%2==0)
return quickerpower(x,n/2)quickerpower(x,n/2);
else if(n%2!=0)
return xquickerpower(x,n-1);
else if(n==0)
return 1;
}
int main()
{
int x=3,n=2,a;
a=quickerpower(3,2);
printf("%d %d",a,pow(x,n));
return 0;
}这两个递归都写错了啊,怎么改都不对。