程序代码:
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
//冒泡排序
void bubble(int a[],int n)
{
for(int i=1;i<n;i++)
{
for(int j=0;j<n-i;j++)
{
if(a[j]>a[j+1])
{
int t=a[j];
a[j]=a[j+1];
a[j+1]=t;
}
}
}
}
//简单选择排序
void simple(int b[],int n)
{
for(int i=0;i<n-1;i++)
{
int min=i;
for(int j=i+1;j<n;j++)
{
if(b[min]>b[j])
{
min=j;
}
}
if(min!=i)
{
int t=b[min];
b[min]=b[i];
b[i]=t;
}
}
}
//直接插入排序
void insert_sort(int c[],int n)
{
int j;
for(int i=1;i<n;i++)
{
int temp=c[i];
for(j=i-1;j>=0&&c[j]>temp;j--)
{
c[j+1]=c[j];
}
c[j+1]=temp;
}
}
//一次排序
int one_sort(int d[],int low,int high)
{
int key=d[low];//确定基准值
while(low<high)
{
while(low<high&&key<=d[high])
high--;
d[low]=d[high];
while(low<high&&key>=d[low])
low++;
d[high]=d[low];
}
d[low]=key;
return low;
}
//快速排序
void quick(int d[],int low,int high)
{
if(low>=high)
return;
int mid=one_sort(d,low,high);
quick(d,low,mid-1);
quick(d,high,mid+1);
}
//输出
void output(int a[],int n)
{
for(int i=0;i<n;i++)
{
printf("%-3d",a[i]);
}
puts("");
}
int main(int argc, const char *argv[])
{
//冒泡排序
int a[]={23,24,12,5,33,5,34,7};
int n=sizeof(a)/sizeof(a[0]);
bubble(a,n);
output(a,n);
//简单选择排序
int b[]={23,24,12,5,33,5,34,7};
simple(b,n);
output(b,n);
//直接插入排序
int c[]={23,24,12,5,33,5,34,7};
insert_sort(c,n);
output(c,n);
//快速排序
int d[]={23,24,12,5,33,5,34,7};
quick(d,0,n-1);
output(d,n);
return 0;
}
运行结果:
程序代码:
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int DigitSum(int n)
{
if(n==0)
return 0;
else
return n%10+DigitSum(n/10);
}
int main(int argc, const char *argv[])
{
int num;
printf("please input num:");
scanf("%d",&num);
int sum=DigitSum(num);
printf("sum=%d\n",sum);
return 0;
}
运行结果:
程序代码:
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define Exchange(num) (((num & 0x55555555) << 1 )|((num & 0xaaaaaaaa) >> 1 ))
int main(int argc, const char *argv[])
{
int num;
printf("please input num:");
scanf("%d",&num);
num=Exchange(num);
printf("%d\n",num);
return 0;
}
运行结果: