搜索资源列表
3040932027project3
- 比较InsertionSort，Shellsort，Quicksort快慢-comparison InsertionSort, Shellsort, Quicksort speed
QuickSort
- 随机生成500个数字并进行快速排序，能够显示排序所用的时间。是算法设计与分析的一道课后题。
quicksort
- 快速查找算法，方便初学者掌握，在此基础上掌握查找的原理。
a1
- Task A ?read from a file, one set of 1000 random values to be sorted and repeat 1000: o sort data using the iterative sort ?record the total time used for the 1000 calls ?repeat the above steps using the quick sort algorithm. ==============
quicksort
- 自己搞得小程序 希望大家多多指教哈 大家多共享哈
quicksort
- 我们编写的是一个实现快速排序算法的c++程序
quickSort
- 快速排序算法的C语言实现，快速排序是经典的排序算法。
quicksort
- This code is an MPI version of the sorting algorithm QuickSort in c++. The partitioning step is meda sequantially, but the split and merge steps are made using Send and Recieve methods.
quicksort
- 本人写的一个快速排序的程序，同时写出了用openmp进行的并行计算程序，并且对于串行和并行进行了时间的比较，希望对于初学openmp的同志有所帮助！-I was sort of a fast process, at the same time to write with the openmp parallel computing procedures, and serial and parallel for a comparison of the time, I hope for the beg
quicksort
- 快排的并行实现，使用openMP,程序自动生成随机数，分别使用单线程和多线程排序，并比较最后的结果-quick sort based on openMP
mergesort
- Merge SOrting using MPI libraries
MPI_HyperQuicksort
- MPI (message passing protocol) based quicksort. HyperQuicksort version (original proposed by C.J Quinn) Tested and Developed in H.U.T by MonteCristo
MPI_RegularSamplingQuickSort
- Regular Sampling Quick Sort (general quicksort) MPI based. Original Proposed by C.J.Quinn. Tested and developed by MPI teams in H.U.T (monteCristo)
QuickSort
- 这是用Delphi编写的快速排序算法的实现过程-It is written in Delphi Quick Sort Algorithm process
test2
- MPI QUICKSORT IN C LANGUAGE
QuickSort
- 快速排序、多线程编程、并行计算。使用OpenMP解决快速排序问题-QuickSort problem
quicksort
- MPI快速排序C代码,并行编程，快速排序，并行编程-quicksort program
QuickSort
- Quicksort is a divide and conquer algorithm. Quicksort first divides a large list into two smaller sub-lists: the low elements and the high elements. Quicksort can then recursively sort the sub-lists. The steps are: Pick an element, called a pivo
quicksort
- 使用MPI编程实现快速排序的并行化 (1) 并行算法的设计 设计快速排序的并行化算法，说明并行化的算法的设计思想。 (2) MPI编程 使用MPI编程实现快速排序的并行化。 (3) 对运行结果的对比和分析。 -Quick Sort programming using MPI parallelization (1) parallel algorithm design parallel algorithm design quick sort, indicating paral
QuickSort
- 快速排序,采用C++的分治思想。是十大排序算法中效率最高的一个-QuickSort,in C++