// 选择法排序staticvoidsort2(void){int i, j, k, temp;int a[N]={12,8,45,30,98,67,2,7,68,11};//十个数值int len =sizeof(a)/sizeof(a[0]);for(i =0; i < len; i++){printf("a[%d] = %d\t", i, a[i]);}printf("\n");for(i =0; i < N-1; i++){
k = i;for(j = i+1; j < N; j++){if(a[j]< a[k])
k = j;}if(i != k){
temp = a[i];
a[i]= a[k];
a[k]= temp;}}for(i =0; i < len; i++){printf("a[%d] = %d\t", i, a[i]);}printf("\n");return;}
四、进制转换
//进制转换staticvoidbase_convert(void){int num;int n[128];int i =0;int base =0;printf("Please Enter the converted num:");scanf("%d",&num);printf("Please enter the base:");scanf("%d",&base);do{
n[i]= num % base;
num = num / base;
i++;}while(num !=0);for(i --; i >=0; i--){if(n[i]>=10){printf("%c", n[i]-10+'A');}elseprintf("%d ", n[i]);}printf("\n");}
五、使用删除法求1000以内所有质数(素数)
//使用删除法求质数(1000以内)staticvoidprimer(void){int i =0, j =0;char primer[1001]={0};for(i =2; i <1001; i++){if(primer[i]==0){for(j = i*2; j <1001; j+=i)
primer[j]=-1;}}for(i =2; i <1001; i++)if(primer[i]==0){printf("%d is a primer.", i);}return;}