A version of the Byte Radix Sort algorithm suitable for the implementation in hardware

2004 ◽  
Author(s):  
D. Sonc
Keyword(s):  
Radix Sort ◽  
Sort Algorithm

scholarly journals Implementation Of Bubble Sort Algorithm On 2 Fruit Models Of Data Selection Using The Java Program Language

Petir ◽  
2021 ◽  
Vol 14 (2) ◽  
pp. 159-169
Author(s):  
Endang Sunandar
Keyword(s):  
Data Sequence ◽  
Radix Sort ◽  
Java Programming ◽  
Advantages And Disadvantages ◽  
Program Language ◽  
Java Program ◽  
Ordered Data ◽  
Sort Algorithm ◽  
Data Sorting ◽  
Quick Sort

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.

scholarly journals Comparison of Bubble and Insertion Sort in Rust and Python Language

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.

scholarly journals ANALISA KOMPUTASI PARALEL MENGURUTKAN DATA DENGAN METODE RADIX DAN SELECTION

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.

scholarly journals Deep Learning-Based Object Detection, Localisation and Tracking for Smart Wheelchair Healthcare Mobility

2020 ◽  
Vol 18 (1) ◽  
pp. 91
Author(s):  
Louis Lecrosnier ◽  
Redouane Khemmar ◽  
Nicolas Ragot ◽  
Benoit Decoux ◽  
Romain Rossi ◽  
...  
Keyword(s):  
Object Detection ◽  
Object Tracking ◽  
Indoor Environment ◽  
Distance Estimation ◽  
Depth Estimation ◽  
Detection Algorithm ◽  
Use Case ◽  
Detection Distance ◽  
Detection Depth ◽  
Sort Algorithm

This paper deals with the development of an Advanced Driver Assistance System (ADAS) for a smart electric wheelchair in order to improve the autonomy of disabled people. Our use case, built from a formal clinical study, is based on the detection, depth estimation, localization and tracking of objects in wheelchair’s indoor environment, namely: door and door handles. The aim of this work is to provide a perception layer to the wheelchair, enabling this way the detection of these keypoints in its immediate surrounding, and constructing of a short lifespan semantic map. Firstly, we present an adaptation of the YOLOv3 object detection algorithm to our use case. Then, we present our depth estimation approach using an Intel RealSense camera. Finally, as a third and last step of our approach, we present our 3D object tracking approach based on the SORT algorithm. In order to validate all the developments, we have carried out different experiments in a controlled indoor environment. Detection, distance estimation and object tracking are experimented using our own dataset, which includes doors and door handles.

Compression evaluation of surgery video recordings retaining diagnostic credibility (compression evaluation of surgery video)

2008 ◽  
Vol 16 (4) ◽  
Author(s):  
M. Duplaga ◽  
M. Leszczuk ◽  
Z. Papir ◽  
A. Przelaskowski
Keyword(s):  
Digital Video ◽  
Vector Measure ◽  
Lossless Compression ◽  
Video Content ◽  
Video Recordings ◽  
Subjective Tests ◽  
Objective Tests ◽  
Correlated Factors ◽  
Sort Algorithm

AbstractWider dissemination of medical digital video libraries is affected by two correlated factors, resource effective content compression that directly influences its diagnostic credibility. It has been proved that it is possible to meet these contradictory requirements halfway for long-lasting and low motion surgery recordings at compression ratios close to 100 (bronchoscopic procedures were a case study investigated). As the main supporting assumption, it has been accepted that the content can be compressed as far as clinicians are not able to sense a loss of video diagnostic fidelity (a visually lossless compression).Different market codecs were inspected by means of the combined subjective and objective tests toward their usability in medical video libraries. Subjective tests involved a panel of clinicians who had to classify compressed bronchoscopic video content according to its quality under the bubble sort algorithm. For objective tests, two metrics (hybrid vector measure and hosaka Plots) were calculated frame by frame and averaged over a whole sequence.

Sign in / Sign up

Export Citation Format

Share Document