搜索资源列表
duanyuanzuiduan.rar
- 单源最短路径问题,分支限界法的优先队列解法,最小堆来存储活结点表,表示活结点优先队列,优先级是结点所对应的当前路长,Single-source shortest path problem, branch and bound method of the priority queue method, the smallest heap to store slipknot points table, said slipknot point priority queue, priority is the
duipaixu
- 用MFC实现的数据结构中的堆排序算法。程序可运行。-MFC implementation of data structures in the heap sort algorithm.The program can run.
heap
- 一个二叉树的例子,初学者可以看一下.a good code-a good code
sjjg
- 1)实现二路归并排序算法。 2)实现希尔排序算法。 3)实现快速排序算法。 4)实现堆排序算法。 (6)已知长度为n的线性表A采用顺序存储结构,该算法删除线性表中所有值为item的数据元素。删除后的数组元素与原数组元素不必保持顺序一致。 一个主函数,调试上述算法。-1) Achieving way merge sorting algorithm. 2) Achieving Hill sorting algorithms. 3) The fast sorting algorit
AStarDll A星路径搜索(采用二叉堆)
- 算法简述:A星路径搜索(采用二叉堆),最短路径寻路算法-Algorithm Descr iption: A star path search (using the binary heap), the shortest path Algorithm for Route
sortdemo
- 采用MFC界面,实现了冒泡排序、堆排序、快速排序、归并排序等常用排序算法的算法演示。-Using MFC interface, implementation of the Bubble Sort, Heap Sort, Quick sort, merge sort sorting algorithm, such as commonly used algorithm demo.
mmc_design
- 单列多服务台排队系统 概要设计 首先根据系统初始化输入的数据对系统进行初始化,根据顾客的数量和顾客平均到达时间间隔,产生系统中每名顾客到达时间间隔,将每名顾客到达时刻插入事件表,事件表根据时间采用最小堆进行排序,最早发生的事件放到事件表的顶端。-Summary of single multi-server queuing system design is first initialize the input data according to the system to initialize
nbpx
- 对十种内部排序的比较.有直接排序,快速排序,折半排序,基数排序,堆排序,等.-Sort of dozens of internal comparison. Have a direct sort, quick sort, binary sort, Radix Sort, Heap Sort, et al.
111
- 第一章、Windows下堆栈溢出入门 第二章、Windows下ShellCode编写初步 第三章、后门的编写和ShellCode的提取 第四章 Windows下堆溢出利用编程 第五章 ShellCode变形编码大法 第六章 ShellCode编写高级技术 第七章、漏洞的发现、分析和利用-The first chapter, Windows stack overflow entry under Chapter II, Windows under Chapter III of
Sort
- 1. 直接插入排序 2. 折半插入排序 3. 希尔排序 4. 起泡排序 5. 快速排序 6. 选择排序 7. 堆排序-1. Direct insertion sort 2. Binary insertion sort 3. Shell sort 4. Bubble sort 5. Quicksort 6. Sorted by 7. Heap Sort
HeapSort
- 最大堆的生成、堆排序,以及一个简单的最大优先队列的实现。-The largest generation heap, heap sort, as well as a simple realization of the greatest priority queue.
STL_quene
- 用c++的STL实现大根堆和小根堆,实现相当方便简单,优先队列效率好-Large root heap and small root heap, quite simple priority queue efficiency c++ the STL
Some-Sorts
- 对常见的各种算法精心总结,含源码。比如快速排序,shell排序,简单选择排序,堆排序,冒泡排序等算法-Various algorithms for the common well summed up, including source code. Such as quick sort, shell sort, simple selection sort, heap sort, bubble sort algorithms such as
HeapBottomUp
- 堆排序,dos界面。简单的堆排序,堆构造,堆删除-Heap sort, dos interface. Simple heap sort, heap constructor heap delete
dui
- 用MFC做的堆排序小程序,输入数字后后能出现大顶堆和小顶堆,用树控件显示-Heap sort using MFC to do a small program, enter the figures after the big top to the top of the heap and a small heap, with the tree control displays
AtlDebugHeap_demo
- 使用ATL跟踪内存错误的例子(如MFC里的try..catch) -The example of tracking the error in memory using ATL
prim
- 图的操作,最小生成树的原代码!(用pirm做的哦!)- Chart operation, smallest production tree s original code! (Does with pirm oh!)
merge
- 在一个圆形操场的四周摆放着n堆石子。现要将石子有次序地合并成一堆。规定每次只能选相邻的2堆石子合并成新的一堆,并将新的一堆石子数记为该次合并的得分。试设计一个算法,计算出将n堆石子合并成一堆的最小得分和最大得分。 编程任务:对于给定n堆石子,编程计算合并成一堆的最小得分和最大得分。-Playground in a circle around the stones are placed n heap. Stone is to have the order to merge into a pi
1125
- poj1125用二叉堆优化的Dijkstra算法-poj1125 binary heap using the Dijkstra algorithm optimization
ycjc
- 缓冲区溢出教程 1.WINDOWS下堆浅溢出入门 2.WINDOWS下SHELLCODE编写初步 3.后门的编写和SHELLCODE的提取 -Buffer Overflow Tutorial 1.WINDOWS under the shallow heap overflow 2.WINDOWS entry Shellcode prepared under the initial 3. The back door of the preparation and extract