C++饭卡信息管理系统大作业源代码和报告

windows media player 9 sdk

企业编码最新汇总-enterprises updated matrix coding

我们java课的一个小作业，画图时耗费了不少脑细胞呢:)-a small operation, the class that costs a lot of brain cells? :)

文学修养，余秋雨文集，写得很深长，写得沉重。苍桑-literary accomplishment Yu Works, written long deep, heavy write. Cangsang

inventory management for shops

一：问题描述 针对某个集体（比如你所在的班级）中的“人名”设计一个哈希表，使得平均查找长度不超过R，完成相对的建表和查表程序。 二：基本要求 假设人名为中国人姓名的汉语拼音形式。待填入哈希表的人名共有30个，取平均查找长度的上限为2。哈希函数用除留余数法构造，用伪随机探测再散列法处理冲突。 三：实现提示 如果随机函数自行构造，则应首先调整好随机函数，使其分布均匀。人名的长度均不超过19个字符（最长的人名如：庄双双（ZHAGN SHUANG SHUANG）。字符的取码方法可直接利用C语言中的tosacii函数，并可对过长的人名先作折叠处理。 四：需求分析 本演示程序是对哈希表的建立和查找进行演示，主要数据来自自己编写的人名“A~~Z”等字母组成，拼音由开头的字母组成的词组，查找时用伪随机探测再散列法处理冲突。随机产生人名的位置。具体的程序内容在源程序里面有比较详细的解析。程序的运行在下列有详细的介绍。 -one : Problem description against any collective (such as your own classes) of "names" design a hash table. you make the average length of not more than R, completes the construction and Lookup Table procedures. Two : the assumption that the basic requirements were known as the Chinese name of Chinese pinyin form. Hash Table question Enter the names of a total of 30, you take the average length of a maximum of two. Hash functions with a few exception I stay constructed using pseudo-random re-hash detection method to resolve disputes. 3 : Achieving suggested ra

/***********************************************************************/

也是用C语言编写的通讯录小程序，以前学C语言设计时做的，希望有所帮助。-，，

opencv 的安装程序，不错的一个对图像处理的库-opencv installation procedures, a good image processing library

最佳适应算法是动态内存分区分配算法的一种。所谓“最佳”是指每次为作业分配内存时，总是把能满足要求、又是最小的空闲分区分配给作业，避免“大材小用”。为了加速寻找，该算法要求将所有的空闲分区按其内容以从小到大的顺序形成一空闲分区链。这样，第一次找到的能满足要求的空闲区，必然是最佳的。-best adaptation algorithm is a dynamic memory allocation through an algorithm. The so-called "best" means the operation of each memory allocation, always meet requirements, and also the smallest area allocated to idle operations, to avoid "a waste of talent." To speed up the search, the algorithm requires that all leisure district according to content from small to large order of the formation of a regional chain idle. So, the first found to meet the requirements of the free zone will be the best.