![](https://img-blog.csdnimg.cn/20201014180756913.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
C
_wangLC
这个作者很懒,什么都没留下…
展开
-
C语言实现堆排序
#include void printfTree(int* tree,int size){ int i; int j; int temp; int sum; i=0; j=1; sum=j; while(i temp=tree[i]; printf("%d\t",temp); i++; if(i==sum){ printf("\n"); j*=2; sum+=j;原创 2017-09-24 19:58:07 · 210 阅读 · 0 评论 -
冒泡排序的链表实现
#include typedef struct node{ int num; struct node *next; }NODE; NODE* makeList(int*,size_t); NODE* sort(NODE* list); int main(){ NODE* head; NODE* curr; int a[]={1,2,4,6,3,5原创 2017-09-24 20:00:00 · 407 阅读 · 0 评论 -
八皇后问题
#include #include #include typedef struct treeNode{ int data; struct treeNode* child[8]; struct treeNode* father; }TNODE; typedef struct tree{ TNODE* root; }TREE; typedef struct linkNode{原创 2017-09-28 13:14:31 · 234 阅读 · 0 评论 -
快速排序
#include int main(){ int list[]={6,1,2,7,9,3,4,5,10,8}; int i; for(i=0;i printf("%d\t",list[i]); } printf("\n"); printf("\n"); sort(list,sizeof(list)/sizeof(int),0); for(i=0;i pri原创 2017-09-28 15:28:41 · 130 阅读 · 0 评论