8_queen

本代码是通过C语言来实现贪心算法求着色问题,包括具体问题和实现代码(This code is the C language to implement the greedy algorithm for the coloring problem, including specific issues and the implementation code)

一个很经典的问题_八数码! 算法速度快,解决问题多...有兴趣的可以(A very classic problem _ eight digital! Fast algorithm to solve the problem ... are interested in more than can be)

设计、编写和调试面向对象C++程序，实现任意两个同类数据比大小 的通用函数（模板），涵盖普通数值型数据之间的比较、两个字符串之间的比较 （按字典序）、两个复数之间的比较（按模大小）等，并通过主函数加以调用和 测试。(Design, writing and debugging of object-oriented C++ procedures to achieve similar data than the size of any two generic functions (template), covering general comparison between numerical data, the comparison between the two strings (lexicographically), two Comparison between complex numbers (modulo the size), and through the main function to be invoked and tested.)

求二叉树的深度: 给定一个有根二叉树，规定连接两个节点的每条边长度是1，定义树的深度为根到叶子节点距离的最大值。 (Description 给定一个有根二叉树，规定连接两个节点的每条边长度是1，定义树的深度为根到叶子节点距离的最大值。 )

阿当姆斯显式和隐式求解方法，用四阶龙格库塔作为起始，然后运用四阶阿当姆斯算法求解初值问题。主要程序包含在test2.cpp中，方法简单易懂。编译环境VC2010(Adam James explicit and implicit method for solving fourth-order Runge-Kutta as a start, then use the fourth-order A Williams algorithm for solving initial value problem. The main program contains in test2.cpp method is simple and easy to understand. Compile environment VC2010)

说明：  数据结构：Huffman编码。哈夫曼编码是哈夫曼树的一个应用。哈夫曼编码应用广泛，如JPEG中就应用了哈夫曼编码。 哈夫曼树又称最优二叉树，是一种带权路径长度最短的二叉树。(Data structure: Huffman coding. Huffman coding is an application of the Huffman tree. Huffman coding is widely used, such as JPEG in the application of the Huffman coding. Huffman tree, also known as the best binary tree is a weighted shortest path length binary tree.)

说明：  100米比赛排名 C++实现100米比赛排名 C++实现(100m rankings C++, the 100 meters ranks C++,)

魔方问题 数据结构 使用c++ 经典问题(Cube problem Data Structure Using c++ Classic problem)

说明：  根据所选定的字符顺序，按照从大到小的规则，对字符进行插入排序，(Insert and sort characters)

说明：  用数据结构的遍历，对于小毛驴过河解决实际问题。(Traversing the data structure used for the small donkey across the river to solve practical problems.)