Results 11 to 20 of about 185,887 (355)
This article considers different aspects which allow defining correctness of choosing sorting algorithms. Also some algorithms, needed for computational experiments for certain class of programs, are compared.
R. Sagan
doaj +2 more sources
Quantum complexities of ordered searching, sorting, and element distinctness [PDF]
We consider the quantum complexities of the following three problems: searching an ordered list, sorting an un-ordered list, and deciding whether the numbers in a list are all distinct.
A. Borodin +9 more
core +5 more sources
Online Sorting via Searching and Selection [PDF]
In this paper, we present a framework based on a simple data structure and parameterized algorithms for the problems of finding items in an unsorted list of linearly ordered items based on their rank (selection) or value (search).
Gupta, Ankur +2 more
core +3 more sources
The mountain hiking destinations become more popular as this is one of the possible ways to cope with workplace stress and to prevent burnout. In contrast to the tourist destinations, mountain hiking requires special attention due to the variety of ...
Dimitrova Zornitsa +4 more
doaj +2 more sources
Search, Screening and Sorting [PDF]
We examine how search frictions impact labor market sorting by constructing a model consistent with evidence that employers interview a subset of a pool of applicants. We derive necessary and sufficient conditions for sorting in applications and matches. Positive sorting is obtained when production complementarities outweigh a counterforce measured by
Cai, Xiaoming +2 more
openaire +5 more sources
Research Progress and Challenge of Programming by Examples [PDF]
Program synthesis means that the computer automatically constructs code that conforms to the specified grammar and user’s given specifications.Programming by examples is a kind of paradigm in program synthesis that takes input and output examples as the ...
YAN Qian-yu, LI Yi, PENG Xin
doaj +1 more source
Sorting, Searching, and Simulation in the MapReduce Framework [PDF]
We study the MapReduce framework from an algorithmic standpoint, providing a generalization of the previous algorithmic models for MapReduce. We present optimal solutions for the fundamental problems of all-prefix-sums, sorting and multi-searching ...
Michael T. Goodrich +2 more
openalex +2 more sources
The Art of Computer Programming, Volume 3, Sorting and Searching [PDF]
Matthew Wilkes
openalex +2 more sources
Some Combinatorial Properties of Certain Trees With Applications to Searching and Sorting [PDF]
Thomas N. Hibbard
openalex +2 more sources
Comparative Analysis of Sorting and Searching Algorithms
Nidhi Sakpal +3 more
openalex +2 more sources

