好吧，跟  http://blog.youkuaiyun.com/morewindows/article/details/6678165  差不多是一样的。。#define ARR_SIZE 30#include #include #include void mergeSort(int *arr, int first, int last, int *temp);

参考 http://www.cnblogs.com/python27/archive/2011/12/08/2281352.html#include #include void swap(char *left, char *right){ char tmp = *left; *left = *right; *right = tmp;}void permutatio

先翻转整个字符串，再翻转每个单词。#include void swap(char *left, char *right){ char tmp = *left; *left = *right; *right = tmp;}void reverse(char *str, int begin, int end){ while(begin < end){ swap(&st

本质上是对二叉树进行中序遍历。二叉树节点和链表节点使用同一个struct，只改变指针指向。#include "stdio.h"#include "stddef.h"#include "stdlib.h"#include "assert.h"struct s_node{int value;struct s_node *lNode;struct s_no

比如“hello        world       hey     baby”变成“hello world hey baby”思想是设置两个指针，前面的(front)一直往前走直到字符串结尾，后面的(last)复制front当前指向的字符，当遇到多个空格时并不复制，而是等到front指向非空格字符时在往前走。#include #include #incl

其实就相当于图的宽度优先遍历。#include "stdio.h"#include "stddef.h"#include "stdlib.h"#include "assert.h"struct s_treeNode{int value;struct s_treeNode *lc;struct s_treeNode *rc;};typedef

#include int split(int a[], int first, int last){int pvt = a[first];int left = first;                                                      // can't written as left = first + 1, which will ca

额，都不知道类别应该选择成神马才合适。#includeint binary(int *arr, int size, int searchValue);int main(){// int arr[] = { 2 5 8 9 12 56 87 99 };e, nothing to say...int arr[] = { 2, 5, 8, 9, 12, 5

简单的hash表实现采用chaining法。#define DIVIDOR 23#define ELE_NUM 100#includetypedef struct t_node{    int value;    struct t_node *next;} Node;void build_table(Node **table, i

在前两天因为一个 } 漏掉而编译器