Abstract
Sorting is one of a classic problem in computer engineer. One well-known sorting algorithm is a Counting Sort algorithm. Counting Sort had one problem, it can’t sort a positive and negative number in the same input list. Then, Modified Counting Sort created to solve that’s problem. The algorithm will split the numbers before the sorting process begin. This paper will tell another modification of this algorithm. The algorithm called Parallel Counting Sort. Parallel Counting Sort able to increase the execution time about 70% from Modified Counting Sort, especially in a big dataset (around 1000 and 10.000 numbers).
Highlights
Sorting is one of many classic problems in a computer engineering
In computer engineering itself, sorting process can be used in many ways, such as network engineering [6][7], big data process [8][9], or in database process [10]
Like any sorting algorithm, Counting Sort will have a list of integer number or character and the algorithm will try to arrange it in any given order
Summary
Sorting is one of many classic problems in a computer engineering. sorting usually being used in computer engineer, but sorting used in another field of study too. Like any sorting algorithm, Counting Sort will have a list (usually an array) of integer number or character and the algorithm will try to arrange it in any given order (ascending or descending). Counting Sort assumes every element in the array contain a number from zero to n where n is a positive integer number. In another research [17], it can be solved by dividing the negative, zero, and positive number into different arrays and the arrays will be sorted one by one. These arrays will merge into one big array which will have a sorted number. The rest of the paper is structured as follows: Section 2 tells about several theories and previous work which related with this paper, Section 3 tells about the modified algorithm, and Section 4 tells about the conclusion and future works related to this paper
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Information Technology and Business
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
