suilingxi的专栏

#include /* *binary insert sort algorithm *author @ suilingxi *2014-1-11 */ int binary_insert_sort(int * array , int low , int high , int mdm){ while(low<=high){ if(mdm<*(array+(high+low)/2

#include /* *speed sort *author @ suilingxi *2014-1-15 */ void speed_sort(int * array , int high ,int low){ /* record the position of the array we want to sort */ int i=low; int j=high; int

#include #include struct node { int num; struct node * next; }; int main(){ int N; int M; printf("please enter the nubmer of N:\n"); scanf("%d",&N); printf("please enter the nubmer of M:\n")

#ifndef BinaryTree_H_ #define BinaryTree_H_ struct binarytree { struct binarytree * left; struct binarytree * right; char content; }; int length(char * array); struct binarytree * init(char * p ,

#ifndef LINK_STACK_H #define LINK_STACK_H struct linkstack{ struct linkstack * next; int content; }; void display(); void push(struct linkstack * node); struct linkstack * pop(); void init(int * ar

#ifndef LINK_QUEUE_H #define LINK_QUEUE_H struct linkqueue{ struct linkqueue * next; int content; }; struct linkqueue * pop(); void push(struct linkqueue * p); void display(); void init(int * arra

#ifndef SORT_BINARY_TREE_H #define SORT_BINARY_TREE_H struct sbt{ struct sbt * left; struct sbt * right; int content; }; struct sbt * init(int * p ,int n); struct sbt * compare(struct sbt * root , s