Results 11 to 20 of about 57,373 (301)
Gamifying Computer Science Education for Z Generation
Information, 2021 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
An Agglomeration Law for Sorting Networks and its Application in Functional Programming [PDF]
Electronic Proceedings in Theoretical Computer Science, 2017 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
Noisy Sorting Without Searching: Data Oblivious Sorting with Comparison Errors [PDF]
, 2023 We provide and study several algorithms for sorting an array of n comparable distinct elements subject to probabilistic comparison errors. In this model, the comparison of two elements returns the wrong answer according to a fixed probability, p_e < 1/2,
Afshar, Ramtin +3 more
core +1 more source
Sorting and preimages of pattern classes [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 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
Bicomponent sorting algorithms [PDF]
, 2023 The possibilities of improving sorting time parameters through preprocessing by stochastic sorting were investigated. The hypothesis that two-component stochastic + classical sorting outperforms classic one-component sorting in terms of time efficiency ...
Halanin, K. K. +4 more
core
Adaptive Shivers Sort: An Alternative Sorting Algorithm [PDF]
ACM Transactions on Algorithms, 2020 We present a new sorting algorithm, called adaptive ShiversSort , that exploits the existence of monotonic runs for sorting efficiently partially sorted data. This algorithm is a variant of the well-known algorithm TimSort , which is the sorting algorithm used in standard libraries of ...
openaire +3 more sources
Parallel Computing for Sorting Algorithms
مجلة بغداد للعلوم, 2014 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
Study of the efficiency of some deterministic preprocessing methods for sorting algorithms [PDF]
, 2023 To verify the hypothesis about decrease in time of sorting by algorithms of different computational complexity experiments have been conducted. Several ideas on deterministic preprocessing of data arrays for sorting algorithms have been tested.
Makarov, O.V., Shynkarenko, V.I.
core
Approximation Algorithms for Sorting λ-Permutations by λ-Operations
Algorithms, 2021 Understanding how different two organisms are is one question addressed by the comparative genomics field. A well-accepted way to estimate the evolutionary distance between genomes of two organisms is finding the rearrangement distance, which is the ...
Guilherme Henrique Santos Miranda +3 more
doaj +1 more source
Electronic Notes in Theoretical Computer Science, 2009 AbstractA high-level overview of the MOQA language is presented. The representation of its data structure, a labeled series-parallel partial order, is shown along with some of the functions allowed upon this data structure. The combination of MOQA's data structure and its functions capture the required calculus to statically obtain the average-case ...
Jacinta Townley +2 more
openaire +1 more source