radix sort
Recently Published Documents


TOTAL DOCUMENTS

61
(FIVE YEARS 8)

H-INDEX

10
(FIVE YEARS 0)

Author(s):  
Marcellino Marcellino ◽  
Davin William Pratama ◽  
Steven Santoso Suntiarko ◽  
Kristien Margi

Petir ◽  
2021 ◽  
Vol 14 (2) ◽  
pp. 159-169
Author(s):  
Endang Sunandar

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.


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.


2020 ◽  
Vol 25 (5) ◽  
pp. 655-668
Author(s):  
Peeyush Kumar ◽  
Ayushe Gangal ◽  
Sunita Kumari

Sorting is an essential operation which is widely used and is fundamental to some very basic day to day utilities like searches, databases, social networks and much more. Optimizing this basic operation in terms of complexity as well as efficiency is cardinal. Optimization is achieved with respect to space and time complexities of the algorithm. In this paper, a novel left-field N-dimensional cartesian spaced sorting method is proposed by combining the best characteristics of bucket sort, counting sort and radix sort, in addition to employing hashing and dynamic programming for making the method more efficient. Comparison between the proposed sorting method and various existing sorting methods like bubble sort, insertion sort, selection sort, merge sort, heap sort, counting sort, bucket sort, etc., has also been performed. The time complexity of the proposed model is estimated to be linear i.e.


2020 ◽  
Vol 8 (2) ◽  
Author(s):  
Favorisen R. Lumbanraja ◽  
Aristoteles Aristoteles ◽  
Nadila Rizqi Muttaqina

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.


Author(s):  
Bashar Romanous ◽  
Mohammadreza Rezvani ◽  
Junjie Huang ◽  
Daniel Wong ◽  
Evangelos E. Papalexakis ◽  
...  
Keyword(s):  

2019 ◽  
Vol 16 (6) ◽  
pp. 50
Author(s):  
Phan Tan Quoc Quoc ◽  
Nguyen Quoc Huy

Sorting is one of important techniques for computer science as well as other technology areas; sorting is used mostly in searching, database management systems, scheduling, and computing algorithms. This paper aims to analyze the timing cost for some sorting techniques without comparison sorting such as Pigeonhole sort, Counting sort, Radix sort, and Bucket sort; these are sorting techniques with linear running time. Each technique is considered in running time, in-place, stable, and extra space if possible. The main contribution of the paper is experiments of sorting techniques in 90 large size test data. This is also a useful reference for working with sorting techniques.


2018 ◽  
Vol 28 (04) ◽  
pp. 1850014
Author(s):  
Alexandros V. Gerbessiotis

Integer sorting on multicores and GPUs can be realized by a variety of approaches that include variants of distribution-based methods such as radix-sort, comparison-oriented algorithms such as deterministic regular sampling and random sampling parallel sorting, and network-based algorithms such as Batcher’s bitonic sorting algorithm. In this work we present an experimental study of integer sorting on multicore processors. We have implemented serial and parallel radix-sort for various radixes, deterministic regular oversampling, and random oversampling parallel sorting, including new variants of ours, and also some previously little explored or unexplored variants of bitonic-sort and odd-even transposition sort. The study uses multithreading and multiprocessing parallel programming libraries with the same C language code working under Open MPI, MulticoreBSP, and BSPlib. We first provide some general high-level observations on the performance of these implementations. If we can conclude anything is that accurate prediction of performance by taking into consideration architecture dependent features such as the structure and characteristics of multiple memory hierarchies is difficult and more often than not untenable. To some degree this is affected by the overhead imposed by the high-level library used in the programming effort. Another objective is to model the performance of these algorithms and their implementations under the MBSP (Multi-memory BSP) model. Despite the limitations mentioned above, we can still draw some reliable conclusions and reason about the performance of these implementations using the MBSP model, thus making MBSP useful and usable.


Author(s):  
Hao Ge ◽  
Chuanjian Yang ◽  
Longshu Li

Attribute reduction is one of key issues in rough set theory, and positive region reduct is a classical type of reducts. However, a lot of reduction algorithms have more high time expenses when dealing with high-volume and high-dimensional data sets. To overcome this shortcoming, in this paper, a relative discernibility reduction method based on the simplified decision table of the original decision table is researched for obtaining positive region reduct. Moreover, to further improve performance of reduction algorithm, we develop an accelerator for attribute reduction, which reduces the radix sort times of the reduction process to raise algorithm efficiency. By the accelerator, two positive region reduction algorithms, i.e., FARA-RS and BARA-RS, based on the relative discernibility are designed. FARA-RS simultaneously reduce the size of the universe and the number of radix sort to achieve speedup and BARA-RS only reduce the number of radix sort to achieve acceleration. The experimental results show that the proposed reduction algorithms are effective and feasible for high dimensional and large data sets.


Sign in / Sign up

Export Citation Format

Share Document