-
class
拓扑排序 -打印输出计算机本科专业4年每学期的课表(Topological sort - computer printout of undergraduate curriculum of each semester for 4 years)
- 2016-12-12 14:53:46下载
- 积分：1
-
basika
经典算法巴斯卡三角的简单实现，vs2010编译通过(Simple implementation of the classic algorithm Pascal triangle, vs2010 compiled by)
- 2012-10-30 13:22:26下载
- 积分：1
-
cPP
数据结构课设，城市地铁站的设计与使用规划(Set data structure class, subway station design and use of planning)
- 2011-07-03 11:58:24下载
- 积分：1
-
BDX
设计、编写和调试面向对象C++程序，实现任意两个同类数据比大小
的通用函数（模板），涵盖普通数值型数据之间的比较、两个字符串之间的比较
（按字典序）、两个复数之间的比较（按模大小）等，并通过主函数加以调用和
测试。(Design, writing and debugging of object-oriented C++ procedures to achieve similar data than the size of any two generic functions (template), covering general comparison between numerical data, the comparison between the two strings (lexicographically), two Comparison between complex numbers (modulo the size), and through the main function to be invoked and tested.)
- 2020-11-28 13:49:29下载
- 积分：1
-
Huffman
哈夫曼树可以使读者快速方便的查找所需文件(Huffman tree allows readers to quickly and easily find the file)
- 2010-06-09 13:09:47下载
- 积分：1
-
11组表达式求值
设计一个表达式求值的程序。该程序必须可以接受包含（，），+，-，*，/的中缀表达式，并求出结果。如果表达式正确，则输出表达式的结果；如果表达式非法，则不输出或输出其他字符。(Design an expression evaluation procedures. The program must accept (,), including +, -, *, / the infix expression, and the results obtained. If the expression is correct, the output of the expression is output; if the expression is illegal, no other characters are output or exported.)
- 2017-06-14 15:06:29下载
- 积分：1
-
paixu
实现冒泡，快速，希尔排序法。并计算，比较他的次数。(Achieve bubbling fast shell sort. And calculate, compare the number of times.)
- 2012-05-21 22:13:12下载
- 积分：1
-
8_queen
8_queen问题的一个自创的算法，还不错！(8_queen)
- 2009-10-21 11:49:24下载
- 积分：1
-
Bigint
利用双向链表实现对两大整数的相加运算。
可以修改数组长度实现更大整数的相加(Realize the use of two-way linked list of integers the sum of the two operations. Can modify the array length to achieve a greater sum of integers)
- 2007-10-18 21:34:06下载
- 积分：1
-
stack
数据结构 堆栈 实现了以下功能：
cout<<"----------------主菜单---------------"<<endl
<<"* 1.建立 *"<<endl
<<"* 2.输出 *"<<endl
<<"* 3.判断栈是否为空 *"<<endl
<<"* 4.栈的长度 *"<<endl
<<"* 5.输出栈顶元素 *"<<endl
<<"* 6.进栈 *"<<endl
<<"* 7.出栈 *"<<endl
<<"* 8.遍历 *"<<endl
<<"* 9.数制转换 *"<<endl
<<"* 10.清空 *"<<endl
<<"* 11.销毁 *"<<endl
<<"* 12.退出 *"<<endl
<<"--------------------------------------"<<endl<<endl (data structure stack)
- 2013-11-01 11:05:10下载
- 积分：1
