3 results for “Quick sort”

Set a search alert

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

Research ArticleOpen accessIn the abstractThe New Matrix Model of Computation Based Purely on Quite a New Concept of the Matrix Computations for Extremely Quick Web Pages LoadingZulfia A. ChotchaevaWe all dream of quick loading. Quicker than it is now. So that it loads immediately. What is needed for this? There are a lot of things to do. The most important things in it are computations. To speed up loading, we need to speed up computations. If we will find the way to multiply large numbers quicker than we … …Journal of Computer Science, Vol. 16, Issue 11 · 27 Nov 2020 · 10,683 accessesView PDF Cite

Research ArticleOpen accessIn the abstractDeterministic Parallel Sorting Algorithm for 2-D Mesh of Connected ComputersHamed Al Rjoub, Arwa Zabian, Ahmad OdatSorting is one of the most important operations in database systems and its efficiency can influences drastically the overall system performance. To accelerate the performance of database systems, parallelism is applied to the execution of the data administration operations. We propose a new deterministic Parallel Sorting Algorithm (DPSA) that improves the performance of Quick sort in sorting an array of … …Journal of Computer Science, Vol. 4, Issue 6 · 30 Jun 2008 · 6,824 accessesView PDF Cite