A Modified Parallel Heapsort Algorithm
0103 physical sciences
0202 electrical engineering, electronic engineering, information engineering
02 engineering and technology
01 natural sciences
3. Good health
DOI:
10.4018/ijsi.2020070101
Publication Date:
2020-05-28T14:46:05Z
AUTHORS (2)
ABSTRACT
Sorting is a fundamental and essential problem required in the wide range of application fields, so many sorting algorithms have been developed. Among those algorithms, heapsort one most elegant efficient algorithms. But no parallel algorithm had presented until authors developed restricted few years ago. This restriction which makes it difficult to be used universally for general data sets. So, this article, present modified free from such can any set. new achieve almost same performance as before.
SUPPLEMENTAL MATERIAL
Coming soon ....
REFERENCES (17)
CITATIONS (1)
EXTERNAL LINKS
PlumX Metrics
RECOMMENDATIONS
FAIR ASSESSMENT
Coming soon ....
JUPYTER LAB
Coming soon ....