Performance analysis of cloud as a feasible platform for HPC applications using radix sort algorithm

There are various kinds of data sorting methods that we know of which are the Bubble Sort, Selection Sort, Insertion Sort, Quick Sort, Shell Sort, Heap Sort, and Radix Sort methods. All of these methods have advantages and disadvantages of each, whose use is determined based on needs. Each method has a different algorithm, where different algorithms affect the execution time. One interesting algorithm to be implemented on 2 variant models of data sorting is the Bubble Sort algorithm, the reason is that this algorithm has a fairly long and detailed process flow to produce an ordered data sequence from a previously unordered data sequence. Two (2) data sorting variant models that will be implemented using the Bubble Sort algorithm are: Ascending data sorting variants moving from left to right, and Descending data sorting variants moving from left to right. And the device used in implementing the Bubble Sort algorithm is the Java programming language.

Download Full-text

MSL: An Efficient Adaptive In-Place Radix Sort Algorithm

Computational Science - ICCS 2004 - Lecture Notes in Computer Science ◽

10.1007/978-3-540-24687-9_83 ◽

2004 ◽

pp. 606-609 ◽

Cited By ~ 2

Author(s):

Fouad El-Aker ◽

Amer Al-Badarneh

Keyword(s):

Radix Sort ◽

Sort Algorithm

Download Full-text

Comparison of Bubble and Insertion Sort in Rust and Python Language

International Journal of Advanced Trends in Computer Science and Engineering ◽

10.30534/ijatcse/2021/761022021 ◽

2021 ◽

Vol 10 (2) ◽

pp. 1020-1025

Keyword(s):

Time Complexity ◽

Tabular Form ◽

Worst Case ◽

Radix Sort ◽

Average Case ◽

Python Language ◽

Sorting Algorithms ◽

Basic Activity ◽

Sort Algorithm ◽

The Given

Sorting is the basic activity in the field of computer science and it is commonly used in searching for information and data. The main goal of sorting is to make reports or records easier to edit, delete and search, etc. It organizes the given data in any sequence. There are many sorting algorithms like insertion sort, bubble sort, radix sort, heap sort, and so forth. Bubble sort and insertion sort are clearly described with algorithms and examples. In this paper, the bubble sort and insertion sort performance analysis is carried out by calculating the time complexity. These algorithm time complexities have been calculated by implementing in the rust and python languages and observed the best case, average case, and worst case. The flowchart shows the complete workflow of this study. The results have been shown graphically and time complexity has been shown in a tabular form. We have compared the efficiency of bubble sort and insertion sort algorithms in the rust and python platforms. The rust language is more efficient than python for both bubble and insertion sort algorithms. However, it is observed insertion sort is more efficient than the bubble sort algorithm.

Download Full-text

ANALISA KOMPUTASI PARALEL MENGURUTKAN DATA DENGAN METODE RADIX DAN SELECTION

Jurnal Komputasi ◽

10.23960/komputasi.v8i2.2662 ◽

2020 ◽

Vol 8 (2) ◽

Author(s):

Favorisen R. Lumbanraja ◽

Aristoteles Aristoteles ◽

Nadila Rizqi Muttaqina

Keyword(s):

The Other ◽

Small Data ◽

Radix Sort ◽

Computing Power ◽

Whole Numbers ◽

Programming Paradigm ◽

Decimal Numbers ◽

Small Parts ◽

Sort Algorithm ◽

Better Than

Increasing computing power is now achieved by replacing the programming paradigm with parallel programming. Parallel computing is a method of solving problems by dividing the computational load into small parts of the computation sub-process. This study describes the comparative analysis of parallel computations in the Selection Sort and Radix Sort algorithms. The data used are in the form of whole numbers and decimal numbers totaling 100 to 2 million data. The test was carried out with three scenarios, namely using two processors, four processors, and 3 computers connected to each other via a LAN network. The results showed that the parallel Selection Sort algorithm for small data was better than the parallel Radix Sort. On the other hand, parallel Radix Sort is better for millions of data than Selection Sort.

Download Full-text