资源列表
LevelTraverse-cengxubianlierchashu
- LevelTraverse.c 上次写的“cengxubianlierchashu.rar（二叉树层序遍历程序）”遍历不能将二叉树的所有结点都遍历，现对其做了微小修改，并调试好。本程序用于层序遍历二叉树.程序开始时先由用户先根序输入二叉树各结点值,建立好二叉树后即可自动进行遍历依次层序输出各结点的值.----Author:zhg 2006.12 E-mail:wudazhg@163.com -LevelTraverse.c last book, "cengxubianlier
LeftChild
- LeftChild.rar 本程序求二叉树的左孩子． ----Author:zhg 2006.12 E-mail:wudazhg@163.com-LeftChild.rar procedures for the binary tree to the left children. ---- Author : zhg 2006.12 E-mail : wudazhg@163.com
yundh
- 简单的运动会积分统计系统 大一主要学习了C和C++，该程序是一个比较基础实用的程序。-simple statistical systems integration Games freshman learning the major C and C, The procedure is a practical basis for comparison procedures.
cjgz
- 简单的成绩管理系统 大一主要学习了C和C++，该程序是一个比较基础实用的程序。-simple performance management system freshman learning the major C and C, the program is a practical basis for comparison procedures.
xyx
- 这是数据结构的应用 有小游戏的开发和计算 如猴子选大王 纸牌 文本统计等-This is the data structure of a small game development, and if the calculation monkey king playing card version of the election statistics
ecstphfm
- 这是数据结构基础算发知识的VC实现 如二叉树遍历、拓扑排序、哈夫曼树等-This data structure is based on the operator's knowledge of VC as binary tree traversal, topological sorting, Huffman tree;
mgqj
- 这小程序可以巩固数据结构中栈的知识，以及用到的递归算法。-procedures can consolidate data structure Stack knowledge, and use the recursive algorithm.
MergeSort2
- 二路合并排序算法，使用分治策略,时间复杂度O(nlog2n), 需要和待排记录等数量的辅助空间，是一种稳定的排序算法-two-way merge sorting algorithm, the use of divide-and-conquer strategy, the time complexity O (nlog2n) Pai and the need to record the number of auxiliary space, is a stable Sort Algorithm
Erathosthenes
- Erathosthenes给一个自然数a，判断是否为质数，最高效的-Erathosthenes to a natural number one, to determine whether the quality of a few, the most efficient. .
dataandstructure
- 送给大家的新年礼物,关于数据结构的东西,希望能给你大家写帮助.-gave you for the New Year gifts, the data structure of the things that would give you to help you to write.
FibonacciHeap
- 斐波那契堆基于二项式堆,在支持以O(1)时间实现插入、合并和以O(log n)实现删除最小元素的基础上，进一步实现了以O(1)实现指定节点值减少和用O(log n)时间完成删除任意节点操作-Fibonacci heap-based binomial heaps of support to the O (1) time to achieve insertion, Merger and O (log n) to achieve the smallest element deleted on the
suanfa
- 这是我今年数据结构的课程设计，课题是实现冒泡排序，快速排序，直接插入排序，直接选择排序的算法比较 绝对原创哦-This is my data structure of this curriculum design, the task is to achieve bubble sort, quick sort, direct insertion sort, directly choose Sort Algorithm relatively absolute originality oh