2 results for “heap sort”

Set a search alert

Research ArticleOpen accessPhrase in the titleComparative Performance Study of Improved Heap Sort Algorithm on Different HardwareVandana Sharma, Satwinder Singh, K. S. KahlonProblem statement: Several efficient algorithms were developed to cope with the popular task of sorting. Improved heap sort is a new variant of heap sort. Basic idea of new algorithm is similar to classical Heap sort algorithm but it builds heap in another way. The improved heap sort algorithm requires nlogn-0.788928n comparisons for worst case and nlogn-n comparisons in average … …Journal of Computer Science, Vol. 5, Issue 7 · 31 Jul 2009 · 6,824 accessesView PDF Cite

Research ArticleOpen accessIn the keywordsA Heapify Based Parallel Sorting AlgorithmM. A.A.A. Hija, A. Zabian, S. Qawasmeh, O. H.A.A. HaijaQuick sort is a sorting algorithm whose worst case running time is θ(n2) on an input array of n numbers. It is the best practical for sorting because it has the advantage of sorting in place. Problem statement: Behavior of quick sort is complex, we proposed in-place 2m threads parallel heap sort algorithm which had advantage in sorting in place … …Journal of Computer Science, Vol. 4, Issue 11 · 30 Nov 2008 · 6,766 accessesView PDF Cite