search

用链表解决约瑟夫问题。 约瑟夫环是一个数学的应用问题：已知n个人（以编号1，2，3...n分别表示）围坐在一张圆桌周围。从编号为k的人开始报数，数到m的那个人出列；他的下一个人又从1开始报数，数到m的那个人又出列；依此规律重复下去，直到圆桌周围的人全部出列。 其中包括一个实验报告，介绍了编程思路和输出结果截图。(List to resolve Joseph. Josephus is the application of a mathematical problem: Given n individuals (numbered 1, 2, 3, ... n, respectively) sitting around a round table around. From number k people began to count off the number to m the man out of the line his next person and from a number off, the man was out of the line number to m so regularly repeated down until roundtable around of the people all of the columns. Including a lab report describes the programming ideas and output screenshots.)

一个经典的旅行商问题源码，不是最优解，只是一种 思路(A classic traveling salesman problem source is not the optimal solution, just a thought)

用c语言写的线性链表的创建、删除、插入、销毁代码(With c language to create a linear linked list, delete, insert, destroy code)

以太网首部的一个c语言程序，代码功能是对设备要传送的帧进行排队(Ethernet header c language program code function is queued frames to be transferred to the device)

实现约瑟夫问题的4种算法，并有计时功能进行效率测试(4 algorithms to resolve Josephus Problem with timing counter for testing efficiency)

哈夫曼编码程序，实现计算编码学中哈夫曼编码程序的源代码。(Huffman coding procedures, the realization of computing science Huffman encoding procedure s source code.)

哈夫曼树，基本的数据结构，用来编码和解码、用数组作为存储结构实现，

数据结构二叉树，及其遍历，镜像，输出等相关操作C++源码。(Binary tree data structure and its traversal, mirror, output the operation C++ source.)

说明：  贪婪算法的简单描述 不过没做完 只是想下个程序 用用。。。。 (greed math)

说明：  还是通讯录系统 增删改查 课程设计 本科学校要求的数据结构课程设计(Or address book CRUD the data structures required by the curriculum design undergraduate schools curriculum design)