资源列表
sort
- 给出快速排序、希尔排序、冒泡排序、选择排序和插入排序的实现并给出测试用例-Gives quick sort, shell sort, bubble sort, selection sort and insertion sort implementation and test cases are given
Sort
- 五种常用的排序算法：冒泡、选择、插入、归并、快速排序的实现-Five commonly used sorting algorithms: bubble, choose, insert, merge, quicksort implementation
Shell-Sort
- 对{9,8,7,6,5,4,3,2,1,0}，采用希尔排序(Shell Sort)，d=5,2,1,输出每趟排序结果。-Of {9,8,7,6,5,4,3,2,1,0}, using the shell sort (Shell Sort), d = 5,2,1, sorting out the results of each trip.
Heapsort
- 对{6,8,7,9,0,1,3,2,4,5}，采用堆排序(Heapsort),输出每趟的建堆和排序结果。-Of {6,8,7,9,0,1,3,2,4,5}, using heap sort (Heapsort), the output of the construction of the heap for each trip and the results.
QuickSort
- 对{6,8,7,9,0,1,3,2,4,5}，采用快速排序(Quicksort),输出每趟的排序结果。-Of {6,8,7,9,0,1,3,2,4,5}, using quick sort (Quicksort), output per trip of the results.
Mergesort
- 对{18,2,20,34,12,32,6,16}，采用归并排序(Mergesort)，输出每趟的排序结果。-} Of {18,2,20,34,12,32,6,16 using merge sort (Mergesort), output per trip of the results.
cirular-queue
- 为充分利用向量空间，克服"假溢出"现象的方法是：将向量空间想象为一个首尾相接的圆环，并称这种向量为循环向量。存储在其中的队列称为循环队列-To take full advantage of vector space, to overcome the " false overflow" phenomenon is: the vector space of imagination for an end to end ring, saying such a vector for th
Sort-binary-tree
- 排序二叉树完整程序代码，C++实现，编译测试通过-Sorting binary tree complete program code, c + + realization, compiled by test
MODEL
- MRF(Most Request First)算法C++程序实现完整project。是server选择优先处理request顺序的算法，改进服务性能。-MRF(Most Request First)，C++， code
Introduction.to.Algorithms
- [算法导论].[Introduction.to.Algorithms].Thomas.H.Cormen.Ronald.L.Rivest.Charles.E.Leiserson.Clifford.Stein.文字版.pdf-[Introduction to Algorithms]. [Introduction.to.Algorithms]. Thomas.H.Cormen.Ronald.L.Rivest.Charles.E.Leiserson.Clifford.Stein. Text versio
h34
- 用c++语言描述的 用链表存储的 判断字符串左右是否对称-whether string is equal
listjiaojibingji
- 此程序用来实现两个链表的交集和并集，重在其算法。-This process used to achieve two lists of intersection and union, focusing on the algorithm.