用c++实现的约瑟夫环

he 8-puzzle will be represented by a 3x3 list of lists positions where the empty box will be represented by the value 9, as shown below: [[9,1,3],[5,2,6],[4,7,8]] Possibility Solution: Only half of the initial positions of the 8-puzzle are solvable. There is a formula that allows to know from the beginning if you can solve the puzzle.To determine whether an 8-puzzle is solvable, for each square containing a value N is calculated how many numbers less than N there after the current cell. For example, to the initial status

关于一个visual basic中文件打开的一个程序应用广泛-on a visual basic documents which opened an extensive application process

路径查找代码[dephi版本代码]-path search code [code dephi version]

货郎担 分枝限界算法图形求解货郎担问题的分枝限界算法图形演示-traveling salesman Branch and Bound graphics algorithm to solve the traveling salesman problem Branch and Bound algorithm graphic demonstration

现在目前为止所有可能出现的二值化程序，您可以调试自己的程序效果，十分方便。

该程序把多种排序集中体现，包含了冒泡法排序、快速排序等多种排序方法，同时还详细讲述各种排序的分析，希望对编程初学者有一定帮助。-procedures for a variety of the sort embodied includes the Bubble Act, ranked Quick Sort and other ranking methods also explain in detail various sort of analysis, and I hope to the program will definitely help beginners.

不使用递归的快速排序法-Quick sort without using recursive

antcolony 蚁群觅食模拟-antcolony ant foraging simulation

关于移动通信工程常用的计算工具-works on the commonly used mobile computing tools

这个是用来GPIO口的使用，可以提供更多初学者初次使用，了解IO口配置，简单入门