![](https://img-blog.csdnimg.cn/20201014180756925.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
数据结构
文章平均质量分 77
silence35
这个作者很懒,什么都没留下…
展开
-
深搜
# include int a[100];int sum = 0;int n;int flag = 0;int num = 0, m;int Deepfind(int sum, int num){ if (sum == m) { flag = 1; } else { for (int i = 0 ; i原创 2015-10-18 02:24:34 · 268 阅读 · 0 评论 -
栈的程序演示
# include # include typedef struct Node{ int data; struct Node *next;}NODE, * PNODE;typedef struct Stack{ PNODE pTop; PNODE pBottom;}STACK, * PSTACK;voi原创 2015-07-15 19:22:16 · 376 阅读 · 0 评论 -
c语言单向列表的创建、插入、删除、排序和遍历。。。
#include #include struct Node//定义链表{ int data; struct Node* next;};struct Node* creat(struct Node *head)//创建链表{ struct Node *p1, *p2; p2 = p1 =(struct Node*) malloc (sizeof (str原创 2015-07-15 19:19:51 · 1469 阅读 · 0 评论 -
迷宫最短
# include #include char a[5][5];int b[5][5];int x = 0, y = 0;int flag = 0, step = 0 ,num = 0;int min(int num, int step){ return num > step ? step : num;}void dfs(int x, int y, int step)原创 2015-10-18 02:22:21 · 470 阅读 · 0 评论 -
快速排序
# include void swap(int a[],int l, int r){ int temp; temp = a[l]; a[l] = a[r]; a[r] = temp; }void Quicksort(int a[],int begin, int end){ if (begin >= end) r原创 2015-07-21 17:17:02 · 235 阅读 · 0 评论 -
全排列
# include # include char pre[100];char ch[100];int used[500];void permutation(int pos, int n){ if ( pos == n) { for (int i = 0; i < n ; ++i) printf("%c",pre[i]);原创 2015-10-18 02:23:08 · 222 阅读 · 0 评论 -
分治(归并排序)
# include void megar1(int ch1[],int ch2 [], int first , int mid, int last ){ int i, j, k; i = k = first; j = mid + 1; while (i != mid + 1 && j != last + 1) { if (ch1[i]原创 2015-07-20 19:01:02 · 306 阅读 · 0 评论 -
二叉树(静态)(遍历)
# include # include struct BTNode{ char data; struct BTNode * pLchild; struct BTNode * pRchild;};struct BTNode * CreateBTree(void);void PreTraverseBTree(struct BTNode *pT);void In原创 2015-07-23 11:56:45 · 434 阅读 · 1 评论