C语言写的Hash算法，在各种平台上都编译通过，可以直接使用。...

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

资源描述数据结构课后题，图方面的代码，如DFS BFS dijistra prim kruscal等,对于初学算法基础课的学生有很大的帮助

1 可执行程序TestLexicon.exe必须与数据库文件在同一个目录下 2 数据库文件名为： lexicon.mdb，可以是access 97版格式的数据库， 也可以是access 2000版格式的数据库 3 双击TestLexicon.exe启动程序 4 选择“词典数据库”下“词库查询1”等进行查询，状态栏显示每个查询的 区别。程序反馈消息框响应用户的查询-One executable program TestLexicon.exe must be consistent with database files in the same directory 2 database file is named: lexicon.mdb, can access 97 database format, as well as access 2000 format database 3 Double-click TestLexicon.exe startup procedure 4 select

本系统为VB开发的通信软件-VB of the system for the development of communications software

清华大学出版的数据结构（C++）的配套课件-Tsinghua University published the data structure (C) matching courseware

由于简单模式匹配算法在一次字符比较失败后，简单的把模式串位置向前移动一个字符位置，这样就丢掉了前面字符匹配中得到的信息，效率差。所以就需要一种无回溯的算法来提高效率，这里使用KMP（Knuth-Morris-Pratt）算法。模式串前面的连续片断部分称“前缀模式”，前缀模式在模式串后部重复出现的情况可以用来避免重复进行已经做过的检查，这是KMP算法中的一个重要概念。-as simple pattern-matching algorithm to compare a character failure, a simple model put forward position Series mobile location of a character, would be lost in front of characters matching the information inefficiently. There is a need for a non-backtracking algorithms to improve efficiency, the use of KMP here (Knuth-Morris-Pratt) algorithm. Model Series in front of a row clips part said "prefix model," prefix string pattern in the pattern of recurring back can be used to avoid duplication of inspection has been done, KMP algorithm is an important concept.

提醒的例子，大家可以去看看 -Remind example, we can go and see

数据结构中顺序查找的例子-sequence data structure search examples

数据结构课程设计，家电管理系统，包括家电的类型，型号（不能输入字母，如需要可以将型号int型改成char即可输入字母），数量，价格。可以创建，插入，删除，查询，打印，更新，销毁。-Data structures curriculum design, home appliance management system, including the type of appliance, model (not type the letter, if necessary, can be type int into a char type to enter letters), quantity, price. You can create, insert, delete, query, print, update, destroy.

最小生成树问题 若要在n个城市之间建设通信网络，只需要架设n-1条线路即可。如何以最低的经济代价建设这个通信网，是一个网的最小生成树问题。 （1）利用克鲁斯卡尔算法求网的最小生成树。 （2）实现教科书6.5节中定义的抽象树类型 MFSet。以此表示构造生成树过程中的连通分量。 （3）以文本形式输出生成树中各条边以及他们的权值。 -minimum spanning tree problem to the n-city building communications networks needed to put up only n-1 lines can be. How the lowest economic cost of building the communications network, the network is a minimum spanning tree problem. (1) using Kelushikaer network algorithm for the minimum spanning tree. (2) to achieve 6.5 textbook definition of the abstract tree types MFSet. Spanning Tree Construction said this process of connectivity components. (3) the form of text output spanning trees and the edge of their weights.