编程珠玑第二章的算法实现

#include <stdio.h>
#include <string.h>
#include <stdarg.h>
#include <stdlib.h>
#include <errno.h>

#define GETBIT(NUM, IDX) ((NUM>>(IDX))&1)
#define INIT_ARRAY(arr) for(int i=0;i<32;i++)arr[i]=0
#define BUF_SIZE 1024
void convert(int num, int mode, int bit[])
{
    int i =0, len=0;
    while(num) {
        bit[i++] = num % mode;
        num /= mode;
    }
    int x=0;
    int temp[32];
    INIT_ARRAY(temp);
    len = i-1;
    x = 32 - len -1;
    printf("%d\n", x);
    printf("%d\n", len);
    /**len = i-1;*/
    for(;i>=1;)
    {
        temp[x++] = bit[i--];
    }
    bit = temp;
}

int search_file(char filename[], char src[], int level)
{
    int filename_len = strlen(filename);
    char filename_one[filename_len+1], filename_zero[filename_len+1];
    char path[filename_len-level], file[level];
    /*fprintf(stdout, "file len is %d\n", filename_len);*/
    strncpy(path, filename, filename_len-level);
    for(int i=filename_len-level, j=0; i<filename_len; i++) {
        file[j++] = filename[i];
    }
    /*fprintf(stdout, "path is %s, file is %s\n", path, file);*/
    sprintf(filename_one, "%s1", filename);
    sprintf(filename_zero, "%s0", filename);

    /*fprintf(stdout, "filename_one is %s\n", filename_one);*/
    /*fprintf(stdout, "filename_zero is %s\n", filename_zero);*/

    FILE *fp = fopen(src, "r");
    FILE *fp_one = fopen(filename_one, "w");
    FILE *fp_zero = fopen(filename_zero, "w");
    char str[BUF_SIZE];
    int i;
    int i_1=0;
    int i_0=0;
    while(fgets(str, BUF_SIZE, fp) != NULL)
    {
       i = atoi(str);
       /*fprintf(stdout, "%d\n", i);*/
       if (GETBIT(i, level) == 1) {
           fprintf(fp_one, "%d\n", i);
           i_1++;
       }
       if (GETBIT(i, level) == 0) {
           fprintf(fp_zero, "%d\n", i);
           i_0++;
       }
    }
    fclose(fp);
    fclose(fp_one);
    fclose(fp_zero);
    if (i_1 == 0) {
        fprintf(stdout, "no number in file, level is %d, filename is %s\n", level, filename_one);
        return 0;
    }
    if (i_0 == 0) {
        fprintf(stdout, "no number in file, level is %d, filename is %s\n", level, filename_zero);
        return 0;
    }

    search_file(filename_one, filename_one, level+1);
    search_file(filename_zero, filename_zero, level+1);
    return 1;
}

void main()
{
    /*int len;*/
    search_file("./test/", "./input.txt", 0); 
}

#include <stdio.h>
#include <string.h>
#include <stdarg.h>
#include <stdlib.h>
#include <errno.h>


void reverse(char num[], int len, int jump, int direction, int start)
{
    if (len < 2*jump && len > 1) {
        reverse(num, len, len-jump, 0, start);
        return;
    } else if (len == 1) {
        return;    
    } else {
        char temp;
        int j=start;
        if (direction == 1) {
            for(int i=0;i<jump;i++) {
                temp = num[i];
                num[i] = num[len-jump+i];
                num[len-jump+i] = temp;
            }
        } else {
            int x=jump;
            for(int i=len-1+start;x<=jump && x>0;i--, j++, x--) {
                temp = num[i];
                num[i] = num[j];
                num[j] = temp;
            }
        }
        if (direction==0) 
            reverse(num, len-jump, jump, direction, j);
        else 
            reverse(num, len-jump, jump, direction, start);
    }
    return;
}

void main()
{
    char num[] = {'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'm', 'l'};
    int len = strlen(num);
    int jump=5;
    reverse(num, len, jump, 1, 0);
    fprintf(stdout, "%s", num);
}

#include <stdio.h>
#include <string.h>
#include <stdarg.h>
#include <stdlib.h>
#include <errno.h>

void reverse(char num[], int start, int end)
{
    int temp;
    for(int i=start, j=end;i<=j;i++,j--) {
        temp = num[i];
        num[i] = num[j];
        num[j] = temp;
    }
}

void main()
{
    char num[] = {'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'm', 'l'};
    int len = strlen(num);
    int jump=3;
    reverse(num, 0, jump-1);
    reverse(num, jump, len-1);
    reverse(num, 0, len-1);
    fprintf(stdout, "%s", num);
}