搜索资源列表
heap
- 从多列有序数据中找出总排名靠前的数据,适用于学生成绩管理中,每科成绩按顺序排好,找出总成绩最高的学生,使用了堆排算法,速度更快。-Ordered the data from multiple columns to find out the overall top-ranking data for student performance management, performance for each subject according to the order of line up to ide
sort
- 常见排序算法的实现性能比较,包括快排,归并、选择、插入、冒泡和堆排序-The realization of the common sorting algorithm performance, including fast row, merge, select, insert, bubbling and heap sort
QuickSort
- 快排,这个是我认为写得最好的快排代码了。快速排序可以在log2(n)的时间内对数组元素进行排序。-Fast row, this is my opinion, the best written fast row code. Quicksort log2 (n) time to sort the array elements.
QSort
- 快排递归算法的实现,测试数据从10000到100000000,并通过计时函数计算不同规模的数据递归快速排序所用的时间-Row fast recursive algorithm, test data 10 thousand to 100 million, and calculate the different sizes of data recursive quicksort time used by the timing function