资源列表
z
- 课程设计，数据结构的关于循环队列，应用为猴子选大王
GA训练神经网络权值
- 利用GA算法训练神经网络权值参数
global-and-by-leve-walvelet-compress-comparission.
- 分层和全局的阈值作用下对比小波压缩效果，及其谱图的不同-global and by level walvelet compress comparission
QuickSort
- 快速排序算法，利用visual C++ 2008实现的源码。-Fast sorting algorithm C++ implementation of the source
Nqueensproblem
- 题目说明： 在一个Ｎ×Ｎ的国际象棋棋盘中摆Ｎ个皇后，使这Ｎ个皇后不能互相被对方吃掉。 题目要求： （１）依次输出各种成功的放置方法。 （２）最好能画出棋盘的图形形式，并动态的演示试探过程。 （３）程序能方便的移植到其它规格的棋盘上。 -Title Descr iption: In an N × N chess board in place N queens, so that the N-Queen can not eat each other to be each
InsertionSort
- 这是拍速算法中的插入排序算法的实现，自己亲写亲测，真实可用。-This is a tempo algorithm insertion sort algorithm, their pro-write pro-test, the real available.
C
- 用函数实现数组的调用，，功能为:从键盘读取一个数，插入原数组中包括函数头的描述，调用，及返回值，-Achieved with an array of function calls, function: read a number from the keyboard, insert the original array, including the first descr iption of the function, call, and return values,
erchachazhaoshu
- 二叉排序数的建立，二叉查找数的算法，源代码，-Binary sort the establishment of the number of binary search the number of algorithms, source code,
2d-dwt
- program for two dimensional discrete wavelet transform
counting-sort
- 计数排序法的典型例子，算法设计与分析基础，第七章时空权衡的基数排序法C++实现.-Typical examples of counting sort method, algorithm design and analysis based on Chapter VII of the space-time trade-offs to achieve the radix sorting method C++
the-Golden-Section-Design
- 利用黄金分割法实现最优化设计，可以用作现代设计技术学科的辅助-The use of the golden section method to achieve the most optimal design, modern design techniques can be used as an auxiliary discipline
bt
- 大学数据结构课程实验之二叉树。vc6.0环境。-The experimental binary tree of university data structure course. Vc6.0 environment.