-
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
-
jiajianfa
长整数四则运算,利用双向循环链表实现长整数的存储,每个结点含一个整形变量。
(Long integer arithmetic, the use of two-way circular linked list to achieve long integer storage, each node contains an integer variable.)
- 2014-05-29 14:41:51下载
- 积分:1
-
Dijkstra
主要是DIJKSTRA经典算法,可以作为单个算法来读,也可以调用。(DIJKSTRA mainly classical algorithm can be read as a single algorithm can also be called.)
- 2010-09-25 17:37:40下载
- 积分:1
-
5-source--code-of-DS--PRO
数据结构课上老师布置的5个小项目的源代码,分别是汽车过河,一元多项式,迷宫,日历,BFS_DFS(failed to translate)
- 2011-05-18 17:01:17下载
- 积分:1
-
Set
使用C语言建立带头结点链表实现了集合。并进行了性能上的优化。(Achieve set using C to build list witch head node. And make optimization in performance.)
- 2009-11-18 13:29:05下载
- 积分:1
-
point
用分治算法(O(nlogn)复杂度)实现寻找n个点中最邻近点对,输出为最邻近距离的平方(Looking for n points nearest point, the output of the nearest neighbor distance squared using the divide-and-conquer algorithm (O (nlogn) complexity))
- 2012-12-16 13:14:04下载
- 积分:1
-
04huffman_a
根据最常用的链表法进行huffman编码,可以手工预制权重,例如n=8的时候即可以在文件中写入,输出相应的编码结果(According to the most commonly used method of Chain Huffman coding, manual can be prefabricated weight, For example, n = 8 when it is written in the document, the output corresponding to the coding results)
- 2007-05-29 19:15:26下载
- 积分:1
-
14160_1239592890aB1K
纯C语言写的小型通用数据库,一个C数据结构组科技小组的作品,附有开发思路PPT,这可是一个宝贵的资源哦,更底层的东西,运行于DOS提示符,可以新建数据库等操作。C的编程高手们值得参考一下。
(Pure C language to write a small general-purpose database, a data structure C Group Technology Group works to develop ideas with PPT, this is a valuable resource Oh, and the bottom of things, running on the DOS prompt, you can operate a new database. C programming masters worthy of reference.)
- 2009-04-13 12:50:21下载
- 积分:1
-
deep-copy
该代码实现了深拷贝的问题,对于深拷贝进行了一系列的介绍,并且显示其与浅拷贝的区别。(A deep copy of the code issues a series of deep copy for presentation, and shows the difference between a shallow copy.)
- 2014-01-03 10:46:48下载
- 积分:1
-
graph-DFS
邻接表存储图,然后进行深度优先遍历及广度优先遍历。(DFS,adjacent matrix)
- 2013-10-27 20:16:41下载
- 积分:1