Article Fingerprint
ReserarchID
3HC7N
Quicksort is well-know algorithm used for sorting, making O(n log n) comparisons to sort a dataset of n items. Being a divide-and-conquer algorithm, it is easily modified to use parallel computing. The aim of this paper is to evaluate the performance of parallel quicksort algorithm and compare it with theoretical performance analysis. To achieve this we implement a tool to do both sequential and parallel quicksort on randomly generated arrays of different size in several runs to provide us with enough data to draw conclusions about the efficiency of using the capability of modern multicore processors together with algorithms designed to increase the speed of sorting large arrays.
Abdulrahman Helal Alruwaili. 2012. \u201cImproving of Quicksort Algorithm performance by sequential thread Or parallel algorithms\u201d. Global Journal of Computer Science and Technology - A: Hardware & Computation GJCST-A Volume 12 (GJCST Volume 12 Issue A10): .
Crossref Journal DOI 10.17406/gjcst
Print ISSN 0975-4350
e-ISSN 0975-4172
Explore published articles in an immersive Augmented Reality environment. Our platform converts research papers into interactive 3D books, allowing readers to view and interact with content using AR and VR compatible devices.
Your published article is automatically converted into a realistic 3D book. Flip through pages and read research papers in a more engaging and interactive format.
Total Score: 133
Country: Saudi Arabia
Subject: Global Journal of Computer Science and Technology - A: Hardware & Computation
Authors: Dr. Abdulrahman Hamed Almutairi, Abdulrahman Helal Alruwaili, Dr. Abdullatif Alabdullatif (PhD/Dr. count: 2)
View Count (all-time): 284
Total Views (Real + Logic): 10399
Total Downloads (simulated): 2589
Publish Date: 2012 07, Mon
Monthly Totals (Real + Logic):
This paper attempted to assess the attitudes of students in
Advances in technology have created the potential for a new
Inclusion has become a priority on the global educational agenda,
Quicksort is well-know algorithm used for sorting, making O(n log n) comparisons to sort a dataset of n items. Being a divide-and-conquer algorithm, it is easily modified to use parallel computing. The aim of this paper is to evaluate the performance of parallel quicksort algorithm and compare it with theoretical performance analysis. To achieve this we implement a tool to do both sequential and parallel quicksort on randomly generated arrays of different size in several runs to provide us with enough data to draw conclusions about the efficiency of using the capability of modern multicore processors together with algorithms designed to increase the speed of sorting large arrays.
Lorem ipsum dolor sit amet, consectetur adipiscing elit. Ut elit tellus, luctus nec ullamcorper mattis, pulvinar dapibus leo.