搜索资源列表
各种排序比较
- 分别实现直接插入排序、冒泡排序、简单选择排序、希尔排序、快速排序、堆排序，并随机生成30个数，比较各算法的时、空性能和稳定性。-respectively direct insertion sort, bubble sort, simple choice, in order of ranking Hill, the quick sort, heap sort, and Random Number Generation 30, a comparison algorithm, the performa
ds_kcsj_cxc
- 《数据结构》排序演示系统。实现6种内部排序。包括直接插入排序，希尔排序，冒泡排序，直接选择排序，快速排序，堆排序。。这是我的数据结构课程设计！-"data structure" Sort demonstration system. Six species of achieving internal order. Including direct insertion sort, Hill, in order Bubble Sort, direct selection, in o
umdhtools
- 微软发布的跟踪内存溢出的工具集UMDH (user-mode dump heap 的缩写).
深入浅出Java堆的管理--垃圾回收
- 深入浅出Java堆的管理--垃圾回收-simple Java heap management -- the garbage collector
php3018exp_c
- php3.0.18 s heap overflow,get a nobody shell.
HeapSort
- 实现heap排序的算法，首先把Heap建立起来，然后通过对Heap的根节点来找出当前最小的节点，依次就可以实现排序了。-achieve heap sorting algorithm to first establish Run, then Run right through the current nodes to identify the smallest nodes can be followed to achieve the ranking.
ms04028
- ms04028漏洞利用程序，利用GDIPLUS.DLL的堆溢出漏洞-ms04028 exploits procedures, the use of GDIPLUS.DLL heap overflow vulnerability
排序程序
- 利用C语言实现，8种排序算法！ 例如：插入排序、快速排序、选择排序、冒泡排序、堆排序、希尔排序、归并排序、基数排序！-using C language, eight algorithm! For example : insert sequencing, Quick Sort, select, in order of Bubble Sort, heap sort, Hill sorting, merging, in order of ranking base!
内部排序的主要算法及相关可实现程序
- 内部排序的所有算法，而且有相关可执行例子，包括插入排序，选择排序，希尔排序，快速排序，堆排序，归并排序等，很全，很孀。-sequencing of all internal algorithm, but is related to the executable examples, including insertion sort, select, in order of ranking Hill, the quick sort, heap sort, merging sequencing, al
堆排序算法的过程演示
- 数据结构堆排序算法的过程演示算法实现的源代码，望多多指教。-data structure heap sorting algorithm demonstration of the algorithm source code, looking for more information.
Sortarithmatic
- 数据结构算法之各种排序算法比较，由c语言编写而成，希尔，快速，堆排序三种-algorithm data structure the various sorting algorithms, the language from c prepared, Hill, rapid and three Heap Sort
someag
- 各种内部排序法演示，程序对输入的无序序列分别用简单插入，折半插入，一趟快速排序，简单选择排序，堆排序等算法进行排序输出。-internal sequencing demonstrated that the procedures for the importation of disorderly sequences were inserted with a simple, half-inserted, the trip rapid sequencing, simple choice, in ord
实验七
- 几种排序算法的动画演示,包括冒泡排序,选择排序,插入排序,快速排序,堆排序,支持单步演示,-several algorithm animation demonstration, including Bubble Sort, select, in order of insertion sort, quick sort, heap sort, support single-step demonstration
subject_1_42045
- 几种排序算法的动画演示,包括冒泡排序,选择排序,插入排序,快速排序,堆排序,支持单步演示-several algorithm animation demonstration, including Bubble Sort, select, in order of insertion sort, quick sort, heap sort, support single-step demonstration
rand2
- 虽然说生成随机数大家都知道.但是要生成指定长度.指定字符组合.随机率在1/2000000.就难了.这是我在做充值卡时写的用来生成充值时写的随机数生成器.也是原创吧.在网上找了一堆不满意,只好自己写了.-generated random number is known to all. However, to generate a specified length. Designated character portfolio. Random rates in the 1 / 2 million.
完整堆排序算法
- 数据结构常用算法的堆排序算法，完整版可直接编译运行，教学实验中常用！-algorithm commonly used data structures heap sorting algorithm, a complete version can be directly translated operations, which are often used in teaching experiment!
数据结构和算法Flash动画演示
- 数据结构和算法Flash动画演示 B树的删除,B树的生长过程,串的顺序存储,单链表结点的插入,单链表结点的删除,堆排序,二叉排序树的删除等-data structures and algorithms Flash animation demo B-tree removal, B-tree growth, the sequence string storage, single linked list of nodes inserted, single linked list of nodes re
Example3D
- 更新的这个C++代码范例演示了一个简单3D引擎。显示屏上所有可见内容都用Open GL ES作了3D渲染；如果终端支持的话该范例也支持硬件加速。这个应用支持S60 3rd Edition及后续版本，可适应不同屏幕尺寸和显示方向。经过更新的这个版本提供了加强的纹理载入并增加了堆与栈的大小。可以从诺基亚论坛网站下载支持S60 2nd Edition和Series 80 2nd Edition的独立范例。主要的类有：OpenGL ES (API), CIdle, Math, CImageDecoder
heap_sort
- 堆积排序(Heapsort)是指利用堆积树（堆）这种资料结构所设计的一种排序算法，可以利用数组的特点快速定位指定索引的元素。-Accumulation sort (Heapsort) is the accumulation of tree (heap) refers to the use of this data structure designed by a sorting algorithm can take advantage of an array of features to quic
zuidatuan.rar
- 使用优先队列分支限界法对单源最短路径问题求解，最小堆作为优先队列的存储结构 使用最小堆来存储活结点，解空间树是一个子集树,Priority queue using branch and bound method of single-source shortest path problem solving, and the youngest heap as a priority queue to use the smallest heap storage structure to store s