ctbfl的博客

#include <stdio.h> int add(int array[],int num){ int ret = 0; if (num==0){ ret = 0; } else if(num==1){ ret = array[0]; printf("函数仅剩最后一个值%d\n",ret); } else{ num=num-1; printf("num=%d ",num);

选择排序 Select_sort #include <stdio.h> //When the array is not sorted, it's a way to sort it, though not quick enough. //Sort descending for example, choose the biggest one and move it to the first place, using swap. Then move the second biggest one to

数组操作（找出100以内的素数） 方法一： #include <stdio.h> //find out all the prime numbers smaller than NUMBERS //solution1: Traverse all the numbers, eliminating composite numbers one by one. int check_is_prime(int test_number, int prime_list[], int count_of_curren

二分查找（美国的各种硬币名称） #include <stdio.h> struct { int amount; char *name; }coins[]={ {1,"penny"}, {5,"nickel"}, {10,"dime"}, {25,"quater"}, {50,"half-dollar"}, }; //binary search can be used only un