快速排序、二叉搜索树

快速排序、二叉搜索树生成、二分查找

之前一直在搞java，C都生疏了，现在开始把常用的数据结构和算法统统打一遍

#include <stdio.h>
#include <stdlib.h>
typedef struct node {
	int num;
	struct node * rchild;
	struct node * lchild;
} Node;
typedef struct queuenode{
	int num;
	struct queuenode *next;
}QueueNode;

typedef QueueNode*(*POP)(QueueNode *);

typedef  void *(*PUSH)(QueueNode *);
typedef struct queue{
	QueueNode *head;
	POP pop;
	PUSH push;
}Queue;


void quickSort(int *p, int n);
void setBinaryTree(Node * nodep, int num) ;
int cmp(int num, int numc);
int binarySearch(int *p, int num, int bottom, int upper, int n);
int main(void) {
	int i = 0;
	Node *head = NULL;
	int a[12] = { 12, 7, 72, 8, 1, 90, 1, 1000, 6, 75, 48, 1 };
	for (; i < 12; i++) {
		if (head == NULL ) {
			head = (Node *) malloc(sizeof(Node));
			head->num = a[i];
			head->lchild = NULL;
			head->rchild = NULL;
		} else {
			setBinaryTree(head, a[i]);
		}
	}
	return 1;
}
void quickSort(int *p, int n) {
	int i = 0, j = n - 1, key = p[0];
	while (i <= j) {
		if (p[j] <= key) {
			p[i] = p[j];
			p[j] = key;
			while (i <= j) {
				if (p[i] >= key) {
					p[j] = p[i];
					p[i] = key;
					break;
				}
				i++;
			}
		}
		j--;
	}
	if (i > 1) {
		quickSort(&p[0], i);
	}
	if (n - 1 - i > 1) {
		quickSort(&p[i + 1], n - 1 - i);
	}
}
int binarySearch(int *p, int num, int bottom, int upper, int n) {

	int middle = (bottom + upper) / 2;
	if (p[middle] == num) {
		return middle;
	} else {
		if (middle == 0 || middle == n) {
			return -1;
		} else {
			if (p[middle] < num) {
				return binarySearch(p, num, middle, upper, n);
			} else {
				return binarySearch(p, num, bottom, middle, n);
			}
		}
	}

	return 1;

}

int findKNum(int *p, int k) {
	return 0;
}
void setBinaryTree(Node * nodep, int num) {
		if (cmp(nodep->num, num)) {
			if (nodep->rchild == NULL ) {
				nodep->rchild = (Node*) malloc(sizeof(Node));
				nodep->rchild->rchild = NULL;
				nodep->rchild->lchild = NULL;
				nodep->rchild->num=num;
			} else {
				setBinaryTree(nodep->rchild, num);
			}
		} else {
			if (nodep->lchild == NULL ) {
				nodep->lchild = (Node*) malloc(sizeof(Node));
				nodep->lchild->rchild = NULL;
				nodep->lchild->lchild = NULL;
				nodep->lchild->num=num;
			} else {
				setBinaryTree(nodep->lchild, num);
			}
		}
}

void dispTree(Node * nodep) {

}

void pushQueue(QueueNode* head){

}

void popQueue(QueueNode * head){

}

int cmp(int num, int numc) {
	return num - numc >0 ? 0 : 1;
}