//快速排序的经典实现(重点)void quick_sort(int *parr, int size){ int base = *parr, tmp = 0; int *start = parr, *end = parr + size - 1; if(size <= 1){ return; } while(start < en...

#include #include typedef struct Node{ int data; struct Node *next;}node;//两个带头结点的有序单链表合并后任然有序//先确定头结点，再在剩下的节点中选择值较小的节点链接到已排好序的尾节点//直到有一个链表为空node *link_merge(node *head1, node *head2){ no

typedef struct Node{ int data; struct Node *next;}node;typedef struct{ node head; node tail;}link;void link_revert(link *p){ node *first = NULL, *mid = NULL, *last = NULL, *tmp = NULL; if(p

#include #include typedef struct Node{ int data; struct Node *next;}node;typedef struct{ node head; node tail;}link;void link_init(link *p){ p->head.next = &(p->tail); p->tail.next = N

#include #include typedef struct Node{ int data; struct Node *next;}node;typedef struct{ node head; node tail; int num; //队列元素个数}queue;void queue_init(queue *ps){ ps->head.next = &(ps-

#include <stdio.h>#include <stdlib.h>struct Node;typedef struct{ struct Node *pnode;}tree;typedef struct Node{ int data; tree left; tree right;}node;//树的初始化函数void tree_init...

#include typedef struct{ int buf[SIZE]; //编译时指定SIZE的值 int num; //栈元素个数}stack;void stack_init(stack *ps){ ps->num = 0;}void stack_delete(stack *ps){ ps->num = 0;}int stack_size(const s

#include typedef struct{ int buf[SIZE]; //编译时指定SIZE的值 int head; int tail; int qty; //队列元素个数}queue;void queue_init(queue *q){ q->head = 0; q->tail = 0; q->qty = 0;}int queue_size(const

#include #include typedef struct Node{ int data; struct Node *next;}node;typedef struct{ node head; node tail; int num; //节点个数}stack;void stack_init(stack *ps){ ps->head.next = &(ps->t

int *search(const int *p_arr, int size, int val){ const int *start = p_arr; const int *end = p_arr + size - 1; const int *mid = NULL; while(start < end){ //首先计算中间点存储区的地址 并...

#include #include typedef struct Node{ int data; struct Node *next;}node;//单链表排序，比较过程中只交换节点数据void link_sort(node *head){ node *tmp1 = head->next; node *tmp2 = NULL; int val = 0; if(tmp1