搜索资源列表
常用的排序(c语言)
- 五个常用的排序方法,用C实现的,包括归并,插入,希尔,快速,冒泡-five commonly used sequencing method, the C achieved, including merging, inserting, Hill, rapid and Bubble
vbC9
- 用VB实现的函数的极致和最优化 包括黄金分割搜索法、不用导数的布伦特法 用导数的布伦特法、多元函数的山单纯形法、多元函数的变尺度法等-VB function of the body and optimization including 0.618 search, not derivative Brent Act, Brent derivative, the multi-function Hill simplex method,
排序算法汇总和比较
- 实现了插入排序,希尔排序, 冒泡排序,快速排序,选择排序,堆排序和归并排序,以及可以对排序的性能进行分析,较适合用作排序算法的学习-achieved insertion sort, Hill, in order Bubble Sort, quick sort, select, in order of ranking and sculpture merge sorting, and sequencing can analyze the p
HillCodor
- 在VC环境下采用希尔密码体制加密、解密和破译。该软件实现了输入任意长度的密钥对文件进行加密和解密,解密密钥和密文保存在文件中。如果有完整的明文和对应的密文可是实现破译功能,即得出加密密钥。-in VC environment with Hill cryptosystem encryption, decryption and decoding. The software arbitrary length of the input to t
排序算法-java
- 用java实现的数据结构排序算法,包括:选择排序、插入排序、冒泡排序、希尔排序、快速排序、堆排序、归并排序。-used to achieve the ranking algorithm data structure, including : Select, in order of insertion sequence and Bubble Sort, Hill sequencing, rapid sequencing, heap sor
几种排序方法的实现
- 用 插入排序, 希尔排序 ,冒泡, 快速排序 , 选择排序 ,堆排序, 归并排序 实现对任意随机数序列,并比较各种方法的运行快慢和复杂度-with insertion sort, Hill sequencing, bubbling Quick Sort, select, in order of ranking sculpture, merging order to achieve arbitrary random series, and
hsdfhjshdj
- 对深度优先(Depth first) 、宽度优先(Breath first) 、爬山法(Hill Climbing) 、 最佳优先(Best first) 以及A*搜索算法进行分析比较,要求: 给出这几种算法的描述; 根据SearchDemonstration程序中给出的示例,给出各算法的执行过程-priority right depth (Depth first), the width of priority (Breath
Debugging C++_code
- VC调试手册的一书的所有源代码 The programs in the following subdirectories are from the Osborne/McGraw-Hill book \"Debugging C++\" by Pappas and Murray. -VC manual debugging of the book The source code for all programs in the F
0305111
- 很好的一个DD。。 能够进行快速排序...利用C语言实现,8种排序算法! 例如:插入排序、快速排序、选择排序、冒泡排序、堆排序、希尔排序、归并排序、基数排序!-good a DD. . To conduct rapid sequencing ... use C language, eight algorithm! For example : insert sequencing, Quick Sort, select, in order
Paralle_programming
- Parallel programming/Lou Baker, Bradley J.Smith .—New York:McGraw-Hill Book Co.,1996源码-Parallel programming / Lou Baker, Bradley J. Smith. - New York : McGraw-Hill Book Co.. 1996-source
Some_Sort_Program_Implement_by_C
- 几种排序算法的C语言实现 用函数实现如下算法: (1) 直接插入排序, 希尔排序 (2) 冒泡排序, 快速排序 (3) 选择排序, 堆排序 (4) 归并排序 (5) 基数排序 -several algorithm using C language function algorithm to achieve the following : (a) direct insertion sort, Hill sequ
GPIF_fifo
- 68013 gpif模式的使用说明,详细代码可以在众山公司下载-68,013 gpif pattern of the use of detailed descr iption of the code can be downloaded from the public Hill Companies
highsasptoolbox
- All M-files are copyrighted, 2000, by Dimitris G. Manolakis, Vinay K. Ingle, and Stephen M. Kogon for use with the book \"Statistical and Adaptive Signal Processing\" published by McGraw-Hill Higher Education, Co.
sdp
- 拓扑,直接插入,冒泡,简单选择,希尔 ,快速,堆排序-topology, direct insertion, bubbling simple choice, Hill, rapid and Heap Sort
Hill
- 血液细胞边缘提取系统,有直方图分析等,详细请见压缩包内-blood cell edge extraction system, a histogram analysis, detailed see compressed within
[asp.net]C.Programming
- [C-#高级编程].McGraw.Hill.-.Advanced.C#.Programming.rar 不需要密码-[C-# Advanced Programming]. McGraw.Hill .-. Advanced.C#. no password Programming.rar
shellsort111
- 附有本人超级详细解释(看不懂的面壁十天!) 一、 实际问题: 希尔排序(Shell Sort)是插入排序的一种。因D.L.Shell于1959年提出而得名。它又称“缩小增量分类法”,在时间效率上比插入、比较、冒泡等排序算法有了较大改进。能对无序序列按一定规律进行排序。 二、数学模型: 先取一个小于n的整数d1作为第一个增量,把文件的全部记录分成d1个组。所有距离为dl的倍数的记录放在同一个组中。先在各组内进行直接
shell(c++)
- 经典的希尔排序算法,对大家学习数据结构及培养编程思想有所启发!-classic Hill sorting algorithm for data to study the structure and culture programming philosophy inspired!
SortArithmetic
- 学习数据结构写的排序代码,有冒泡排序、直接插入、希尔排序、简单选择排序、快速排序、堆排序-study data structure was sort of code, Bubble Sort directly inserted, Hill, in order of simple choice, in order of Quick Sort, Heap Sort
Tutorial_29_Vertex_Shader_Position
- 本例展示了D3D9.0中使用顶点着色器(Vertex Shader, *.vsh)绘制的过程。 本例运行的软硬件环境: Visual C++ 7.0 Direct3D 9.0 盛崇山版权所有-the cases demonstrate the use of D3D9.0 vertex coloring (Vertex Shader. *. vsh) preparation process. The ca