搜索资源列表
转8幅bmp240 64为16K二进制.rar
- C 转换8幅bmp240+64为16K二进制表-C conversion eight bmp240 64 to 16K binary Table
数据结构中所用的8种排序方法
- 本程序集合了数据结构8种主要的排序方法:插入排序、冒泡排序、选择排序、快速排序、希尔排序、堆排序、归并排序、基数排序。-the procedures set of data structure of the eight major sequencing method : Insert ranking Bubble Sort, select, in order of Quick Sort, Hill sequencing, heap sort, merge, in order of ranking
8数码hot
- 8数码问题,我本科毕业设计,vc6.0制作,可动态演示!-eight digital, I graduated design, vc6.0 production, dynamic demo!
C++ Builder程序员学习数据结构第8章
- C++ Builder程序员学习数据结构第8章-Builder programmers learn C data structures Chapter 8
8
- 8、对中缀表达式(如(2+3.25)*4=)求组,读入表达式的各项滤去空格,直到读入\"=\",处理过程中若发生错误,则输出相应的错误信息,读入结束后,计算表达式中的各项,打印表达式的结果
8皇后动态图形
- 清华大学版的数据结构书实验编的解决8皇后问题的原程序,还是动态的显示。-version of the experimental data structure book series to solve the problems of the original Queen's procedures, or dynamic display.
8
- This program identifies the best poker hand made up of 5 cards from the 7 provided. These cards are - or space separated and look like this: 3S-9D 5S-6D-TH-2S-KC. The first letter of each pair is the value which is one of 2,3,4,5,6,7,8,9,T,J,Q,K, A.
8QueenPShow
- 8皇后问题及深/宽度优先的讲解及 8皇后问题.exe的演示程序-8Queen Problem Slide Presentation and Execution Show
8
- 用A*启发式算法解决八数码问题,用纯C实现-using A* algorithm to solve Eight-puzzle
8-Queen-presentation-of-the-original-code
- 数据结构课程设计经典问题八皇后动态演示原代码-Classic problem of data structure, curriculum design, dynamic presentation of the original code 8 Queens
eightQueens
- 8皇后问题的解决方案,挺详细的,提供参考-the question about eight queens
8-pluzze
- 这个是基于启发式搜索算法解八数码问题的一个演示程序,旨在演示启发式搜索及A*算法的基本使用方式。内部已经写好了三种启发式算法,可以在使用过程中选用。并另附了一份实验报告。-This is based on the heuristic search algorithm for solving the the 8-puzzle Problem. Program showed how to use heuristic search and A* algorithm. Within three heu
8-Queen
- C++8皇后源代码 MFC非常好用的程序哦-C++8 Queen MFC source code is very easy to use program oh
8-Queen
- 这是一个关于8皇后的源代码,是用C语言开发,会输出92中结果。-This is a 8 Queen' s source code is written in C language development, will result in the output 92.
8
- 8皇后的C#实现,可以自定义输入皇后数,并智能显示出皇后的N中方案。-N-Queens of the C# implementation, you can customize the number of input Queen, and the N-smart show in Queen s program.-8 Queen' s C# implementation, you can customize the number of input Queen, and the N-smart
8-REINAS
- Algoritmo de las 8 reinas
8-queens-problems
- 用回溯递归法有效解决八皇后问题,这个问题是数据库中的经典例题,用c语言实现。-8 queens problems
8-digit-BrandABound
- 广度优先搜索实现8数码问题,C语言实现,代码不长,不到三百行,仅供参考。-implemention of 8 digital problem by Breadth first search
8-digit-ClimbM
- 通过使用爬山法实现8数码问题,代码约三百行,仅供参考-Mountain climbing method to implement 8 digital problem
8-queens-problems
- MFC实例, 八皇后问题, 八皇后问题是一个古老而著名的问题,是回溯算法的典型例题。该问题是十九世纪著名的数学家高斯1850年提出。-MFC example, 8 queens problems, 8 queens problems is an ancient and famous problem, is the typical examples of retrospective algorithm. The problem is the nineteenth century famous ma
