资源列表
danlianbiao
- c编的,数据结构实验报告,很详细.流程都有 是单链表交并差的-c allocation and data structure of experimental reports, in great detail. process is a single linked list has to pay and poor
guangyibiao
- 主要是实现广义表相关操作的算法，并包括有详细报告-Mainly related to the realization of the generalized form of the algorithm operation, and include a detailed report
erchashu
- 二叉树的各种遍历，用菜单形势实现的。前序中序后序层序-A variety of tree traversal, using the menu situation achievable. Preorder in sequence after sequence sequence
flash
- 数据结构中有关查找和排序，以flash格式表现算法是如何实现的。-Data structure relating to search and sort to flash format of the performance of algorithm is how to achieve.
huffman
- 哈夫曼编码^译码器 数据结构经典实验 我们大多数情况下作为参考-^ Huffman decoder data structure of our classic experiment in most cases as a reference
tanxinsuanfa
- 本文章介绍了贪心算法的过程及运用C语言的实现-This article describes the process of greedy algorithm and the realization of the use of C language
lianbiaopaixu
- 2008软件公司笔试题：两个链表插入排序，VC编写-2008 software company T questions: Two linked list insertion sort, VC preparation
paixu
- 2008软件公司面试题:排序大全：简单选择排序、冒泡排序、选择排序、shell排序、快速排序、插入排序、堆排序(从小到大)、归并排序（利用递归）-2008 software companies face questions: Sort Guinness: simple choice to sort, bubble sort, select sort, shell sort, quick sort, insert sort HEAPSORT (from small to large), Mergi
we
- 简单的链表实现 链表可以初步了解-A simple list can be linked to achieve a preliminary understanding
Insert_sort
- void insert_sort(int *a,int n) { if(n==1) return insert_sort(a,n-1) int temp=a[n-1] for(int i=n-2 i>=0 i--) { if(temp<a[i]) a[i+1]=a[i] else break } a[i+1]=temp }-void insert_sort (int* a, int n) (if
NQueen
- 递归方法解决N皇后问题，依次显示所有路径。-Recursive solution to N Queen s problem, show all the path followed.
bitree
- 主要是关于二叉树的顺序存储的，首次上传，多多指教啊，额-Mainly on the binary tree stored in the order, for the first time From the exhibitions ah, the amount of