搜索资源列表
qsort3.zip
- 不使用递归的快速排序法,Quick sort without using recursive
qsort4
- 快速排序模板-Quick sort template
QSort
- 这是个快速排序(用JAVA写的``` )-This is a quick sort (with JAVA wrote `` ````)
Qsort
- 快速排序(分治法实现) 快速排序(分治法实现)-Quick Sort (sub-rule method) quick sort (sub-rule method)
qsort
- 快速排序算法,支持自定义快速排序算法和c++库排序算法。-Quick Sort algorithm, support for custom quick sort algorithm and c++ library sorting algorithm.
sortings
- Implementations of different methods of sorting: BinaryInsertions.pas BubbleSort.pas HeapSort.pas InsertionBorder.pas InsertionSort.pas modifbubble.pas qsort.pas quicksort.pas selection.pas Shaker.pas shell.pas
DONGHUA
- 动画排序演示系统。请将该tc2放至d:盘底下,直接双击paixu.exe 即可以运行。其中: "yshead.c"为软件的封面,paixu.c为主菜单,ysmaopao.c冒泡法演示,insort.c 插入排序 qsort.c快速排序演示,xesort.c希尔排序,SLSORT2.C选择排序,rjend.c结束后的提示语 ysfun.c软件常用的一些函数,比如输入输出函数等。 Hz12,hz16为字库文件。 -The cartoon arranges in an order
source
- 快排序,最短路径,最长公共字串,排列组合,广搜-qsort,shortpath
QSort
- Quick sort algorithm implemantation
ZOJ1044_Index_Generation
- ZOJ1044 Index Generation.主要在于合理运用了qsort函数.-ZOJ1044 Index Generation. Mainly due to a reasonable use of the qsort function.
huffman
- 在网上能够找到的最简单,最快速的哈夫曼编码。本方法不使用任何扩展动态库,比如STL或者组件。只使用简单的C函数,比如:memset,memmove,qsort,malloc,realloc和memcpy。-Online to find the simplest, fastest Huffman. This method does not use any extension of the dynamic libraries, such as STL or components. Only usin
SimpleQuickHuffmanCode
- 本文描述在网上能够找到的最简单,最快速的哈夫曼编码。本方法不使用任何扩展动态库,比如STL或者组件。只使用简单的C函数,比如:memset,memmove,qsort,malloc,realloc和memcpy。 大家都会发现,理解甚至修改这个编码都很容易-This article describes the Internet to find the simplest, fastest Huffman. This method does not use any extension of
calculator
- QSort is the fastest sorting method known. This is a c++ implementation.
QSort
- This file is a quick sort implementation, it has an O ( n lg n )
3
- 本文描述在网上能够找到的最简单,最快速的哈夫曼编码。本方法不使用任何扩展动态库,比如STL或者组件。只使用简单的C函数,比如:memset,memmove,qsort,malloc,realloc和memcpy。 -This article describes the Internet can find the simplest, most fast Huffman coding. This method does not use any extension dynamic librarie
quicksort.cpp
- Quick sort using MPI
Babelfish
- ACM经典算法题 Babelfish 用于理解QSORT 和 BSearch的典型程序 即快排和2分查找 后面的RANKlist类似 可做练习-Acm Qsort+Bsearch (Ranklist is same as a practice)
RankList
- Acm 经典算法题 类似于Babelfish 理解了后可用Ranklist 来练习 Qsort+Bsearch-Acm Ranklist (as a practice of Qsort+Bsearch)
qSort
- 快速排序算法,基于c++实现。值得学习。-quick sort
5
- 非递归的快速排序算法-#include <iostream> #include <stack> #define MAX_SIZE 11 using namespace std typedef int elem typedef std::stack<int> Stack int partition(elem*pData, int low, int high) voi