migong

本资料为数据结构的相关试卷，可以帮助大家解决一下有关考试的问题(This information is relevant papers data structure that can help you solve the problems concerning the examination)

这半查找法 是一种快速查找算法 查找效率比较高 容易实现 理想的查找算法(This search method is a fast and find more efficient algorithms to find easy to implement the ideal search algorithm)

经典算法巴斯卡三角的简单实现，vs2010编译通过(Simple implementation of the classic algorithm Pascal triangle, vs2010 compiled by)

Huffman编码与译码，实现数据结构树的功能。(Huffman coding and decoding, data structure tree functions.)

循环链表的应用 循环链表的应用 很方便的实现(cycle Chain cyclic chain of convenience Implementation)

说明：  约瑟夫算法，适合初步学习数据结构的同学了解递归调用的特点(josephus in C language)

自己做的一个用用栈实现类的操作，是课内作业，希望和大家互相交流(Own a type used by the realization of the operation of the stack is class work, hope and we can exchange ideas)

模拟枝晶生长，在统计学常用的一种算法，对随机理论有帮助。(Simulation of dendritic growth, the statistics used an algorithm, the stochastic theory.)

哈夫曼树可以使读者快速方便的查找所需文件(Huffman tree allows readers to quickly and easily find the file)

经典数据结构作业，黑杰克游戏。要求程序可以连续打10次，每场比赛的赢家，赢得一个点（两点一倍）。在结束的10场比赛为你和电脑打印出的总奖金。(Write a program that simulates a simplified version of the game "BlackJack". A deck of cards numbered 2 to 10, jacks, queens, kings, and aces is used, where jacks, queens and kings are counted as 10s, and aces are either 1 or 11 at your choice. )