数据结构算法及其应用

binaryheap，二叉堆，数据结构中二叉堆的C语言实现-binaryheap, binary heap, data structures binary heap realize the C language

一个表达式求值样例程序，对于C++初学者很有帮助-a sample of expression evaluation,it will be helpful for C/C++ fresher

将数据从文本文件中按照规定格式装入INFORMIX数据库中，再从数据库中转出为文本文件并同时剔出相同号码-data from the text file format required load INFORMIX database and then transferred from the database to a text file and to get rid of the same number

MD5算法的java实现，完整的代码，供大家学习只用-java MD5 algorithm to achieve complete code for all to study only

C# 之中 Serial port 的簡單連接教學 串口:/dev/ttyUSB0 鮑率:9600 位元:8 基數檢查碼:1

背包问题运用贪婪算法的matlab 程序实现-Use of greedy algorithm knapsack problem of matlab program

数据库应用之一:车辆管理系统,用Visual FoxPro-One of database applications: vehicle management system, using Visual FoxPro

数据结构语言概述-language data structure outlined

广义表的反序 逆置广义表的递归模型如下： F(LS) = null 　　　　　　　　　　　　　若 LS 为空 F(LS) = LS 　　　　　　　　　　　　　若 LS 为原子，且 tail(LS) 为空 F(LS) = append( F(tail(LS)), head(LS) ) 　若 LS->tag=0 ，且 LS->tp!=null F(LS) = append( F(tail(LS), F(head(LS)) ) 　若 LS->tag=1 其中 append(a,b) 的功能是将广义表 a 和 b 作为元素的广义表连接起来。-Generalized table set against the broad anti-order recursive model of the table is as follows: F (LS) = null if the LS is empty F (LS) = LS if LS for the atoms, and the tail (LS) is empty F (LS) = append (F (tail (LS)), head (LS)) if the LS-> tag = 0, and the LS-> tp! = null F (LS) = append (F (tail (LS), F (head (LS))) If the LS-> tag = 1 where append (a, b) function is a generalized form, and b as elements of generalized tables connected.

wince扩展数据库编程中利用ADO访问Access数据库-wince extended database programming using ADO to access Access database