— This paper presents fast parallel sorting algorithm which uses division in subsets and quick sort algorithm. The proposed algorithm is evaluated by analytic way and results shows that it will be faster than algorithm in [3] when time for division in subsets of all set is bigger than time for sending/receiving of partial subsets
Primary Language | English |
---|---|
Journal Section | Reviews |
Authors | |
Publication Date | February 27, 2015 |
Published in Issue | Year 2015 Volume: 3 Issue: 1 |
All articles published by BAJECE are licensed under the Creative Commons Attribution 4.0 International License. This permits anyone to copy, redistribute, remix, transmit and adapt the work provided the original work and source is appropriately cited.