Results 1 to 10 of about 5,697,479 (365)
Empirical Evaluation of Unoptimized Sorting Algorithms on 8-Bit AVR Arduino Microcontrollers [PDF]
Resource-constrained sensor nodes in Internet-of-Things (IoT) and embedded sensing applications frequently rely on low-cost microcontrollers, where even basic algorithmic choices directly impact latency, energy consumption, and memory footprint.
Julia Golonka, Filip Krużel
doaj +2 more sources
Sorting has been a profound area for the algorithmic researchers and many resources are invested to suggest more works for sorting algorithms. For this purpose, many existing sorting algorithms were observed in terms of the efficiency of the algorithmic ...
NIDHAL . K EL ABBADI +1 more
doaj +2 more sources
The purpose of this paper is to present a sorting algorithm that allows parallel execution of comparison operations, analysing complexity and runtime of the algorithm, discussing about a virtual process for this algorithm, and the implementation of the C++ program that simulates such a virtual process.
I.F. Koval, Юрий Крак
openalex +3 more sources
Sorting algorithm acceleration based on CPU-FPGA heterogeneous system
Traditional sorting methods are mainly implemented in software serial mode, including bubble sorting, selective sorting and so on. These algorithms often use sequential comparison, and the operation time complexity is relatively high.
Kou Yuanbo +3 more
doaj +1 more source
Gamifying Computer Science Education for Z Generation
Generation Z members use their smart devices as part of their everyday routine. Teaching methods may need to be updated to make learning materials more interesting for this generation.
Hadeel Mohammed Jawad, Samir Tout
doaj +1 more source
Systematic review and exploration of new avenues for sorting algorithm
Sorting plays a crucial role in almost all algorithms that support data science applications. A quadratic sorting algorithm is one in which the time taken for the algorithm to sort a dataset grows as the square of the size of the dataset. This paper aims
Anand Zutshi, Dipanjan Goswami
doaj +1 more source
An Agglomeration Law for Sorting Networks and its Application in Functional Programming [PDF]
In this paper we will present a general agglomeration law for sorting networks. Agglomeration is a common technique when designing parallel programmes to control the granularity of the computation thereby finding a better fit between the algorithm and ...
Lukas Immanuel Schiller
doaj +1 more source
Sorting and preimages of pattern classes [PDF]
We introduce an algorithm to determine when a sorting operation, such as stack-sort or bubble-sort, outputs a given pattern. The algorithm provides a new proof of the description of West-2-stack-sortable permutations, that is permutations that are ...
Anders Claesson, Henning Úlfarsson
doaj +1 more source
Optimal Algorithms for Sorting Permutations with Brooms
Sorting permutations with various operations has applications in genetics and computer interconnection networks where an operation is specified by its generator set. A transposition tree T=(V,E) is a spanning tree over n vertices v1,v2,…vn.
Indulekha Thekkethuruthel Sadanandan +1 more
doaj +1 more source
Parallel Computing for Sorting Algorithms
The expanding use of multi-processor supercomputers has made a significant impact on the speed and size of many problems. The adaptation of standard Message Passing Interface protocol (MPI) has enabled programmers to write portable and efficient codes ...
Baghdad Science Journal
doaj +1 more source

