资源列表
J_Queen
- 用JAVA实现的一个解决八皇后问题的小程序-with a solution of the Statue of eight small programs
re
- 快速傅里叶变换（FFT）算法。FFT - Fast Fourier transform. The length of X must be a power of two, for a fast radix-2 fast-Fourier transform algorithm is used
ex3_finEcx
- 计算最小二乘法ordinary least squares
Untitled6
- 基于梯度法的RBF 网设计算法，已验证，可用
8SM2
- 双向广度优先搜索算法法见8SM2.cpp文件，vc6.0环境运行实现-two-way breadth - first search algorithm see 8SM2.cpp France, achieving operating environment vc6.0
PrintBinaryTree
- 数据结构课程设计，打印二叉树的算法的实现-Data structure course design, print binary tree implementation of the algorithm
sjpeg
- /* Copyright (C) 2001-2006 artofcode LLC. All Rights Reserved. This file is part of GNU ghostscr ipt GNU ghostscr ipt is free software you can redistribute it and/or modify it under the terms of the version 2 of the GNU General Pub
ALGO3-9
- 用递归函数求解迷宫问题(求出所有解) 只是一个程序 已经编译通过 有详细的注释-Recursive function to solve maze problems (all the solutions obtained) is a program has been compiled through detailed notes
ComputeCubicFunction
- 解一元三次方程，并提示是继续操作还是退出操作-show how to compute a cubic function
beibao
- 0-1背包问题：给定n种物品和一个背包，物品i的重量是Wi，物品i价值为Vi，背包的容量为C。应如何选择装入背包的物品，使得装入背包中物品的总价值最大? 在选择装入背包的物品时，对每种物品i只有两种选择，即装入背包为1或不装入背包为0。不能将物品i装入背包多次，也不能只装入部分的物品i。0-1背包问题的主要特点是在选择物品i装入背包时，每种物品仅有一件，可以选择放或不放-0-1 knapsack problem: Given n types of items and a backpack, th
1-
- 单服务员排队系统 可以直接用的哈 已经通过VC++试验过了-Of Queuing System can be used directly, ha has been tested by VC++
SOJKHFFX
- 数据结构的简单应用、队列和表的简单增删改查-Simple deletions simple application data structures, queues, and tables to the investigation