Fast Parallel Sorting Algorithm Using Subsets and Quick Sort
نویسندگان
چکیده
منابع مشابه
Quick Sort Algorithm
Given an array with n elements, we want to rearrange them in ascending order. In this paper, we introduce Quick Sort, a divide-and-conquer algorithm to sort an N element array. We evaluate the O(NlogN) time complexity in best case and O(N) in worst case theoretically. We also introduce a way to approach the best case.
متن کاملSmart Sort: a Fast, Efficient and Robust Sorting Algorithm
Smart Sort algorithm is a “smart” fusion of heap construction procedures (of Heap sort algorithm) into the conventional “Partition” function (of Quick sort algorithm) resulting in a robust version of Quick sort algorithm. We have also performed empirical analysis of average case behavior of our proposed algorithm along with the necessary theoretical analysis for best and worst cases. Its perfor...
متن کاملMQ Sort an Innovative Algorithm using Quick Sort and Merge Sort
Sorting is a commonly used operation in computer science. In addition to its main job of arranging lists or arrays in sequence, sorting is often also required to facilitate some other operation such as searching, merging and normalization or used as an intermediate operation in other operations. A sorting algorithm consists of comparison, swap, and assignment operations[1-3]. There are several ...
متن کاملFast parallel GPU-sorting using a hybrid algorithm
This paper presents an algorithm for fast sorting of large lists using modern GPUs. The method achieves high speed by efficiently utilizing the parallelism of the GPU throughout the whole algorithm. Initially, GPU-based bucketsort or quicksort splits the list into enough sublists then to be sorted in parallel using merge-sort. The algorithm is of complexity n log n, and for lists of 8M elements...
متن کاملA Fast, Storage-eecient Parallel Sorting Algorithm
A parallel sorting algorithm is presented for storage-eecient internal sorting on MIMD machines. The algorithm rst sorts the elements within each node using a serial sorting algorithm, then uses a two-phase parallel merge. The algorithm is comparison-based and requires additional storage of order the square root of the number of elements in each node. Performance of the algorithm on two general...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Balkan Journal of Electrical and Computer Engineering
سال: 2015
ISSN: 2147-284X
DOI: 10.17694/bajece.12812