Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 225,190,746 papers from all fields of science
Search
Sign In
Create Free Account
Sorted array
A sorted array is an array data structure in which each element is sorted in numerical, alphabetical, or some other order, and placed at equally…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
29 relations
Amortized analysis
Array data structure
Binary search algorithm
Bubble sort
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Configuration interactions of class 11: An error in Cowan's atomic structure theory
A. Kramida
Computer Physics Communications
2017
Corpus ID: 20756074
2015
2015
SOCLEER: A social-based energy-efficient forwarding protocol for opportunistic networks
Nelson Machado
,
C. A. V. Campos
International Conference on Wireless…
2015
Corpus ID: 12012287
Opportunistic networks are formed by selforganizing wireless nodes, in which data delivery is not guaranteed, due to intermittent…
Expand
2011
2011
Thread-Level Parallel Algorithm for Sorting Integer Sequence on Multi-core Computers
Cheng Zhong
,
Qi Ke
,
Jun Liu
,
Yiran Huang
Fourth International Symposium on Parallel…
2011
Corpus ID: 5444759
According to the characteristics of multi-core architectures and binary storage property of integer sequence, this paper proposes…
Expand
2011
2011
A genetic algorithm for solving multiple warehouse layout problem
Dragan Matic
,
V. Filipovic
,
A. Savic
,
Z. Stanimirović
2011
Corpus ID: 6611263
In this paper we present a genetic algorithm (GA) for solving NP-hard Multiple Warehouse Layout Problem (MLWLP). New encoding…
Expand
2009
2009
Distributed Arrays: A P2P Data Structure for Efficient Logical Arrays
Daisuke Fukuchi
,
Christian Sommer
,
Y. Sei
,
S. Honiden
IEEE INFOCOM
2009
Corpus ID: 3007870
Distributed hash tables (DHT) are used for data management in P2P environments. However, since most hash functions ignore…
Expand
2008
2008
Task Parallel Skeletons for Divide and Conquer
Michael Poldner
,
H. Kuchen
2008
Corpus ID: 17123710
Algorithmic skeletons intend to simplify parallel programming by providing recurring forms of program structure as predefined…
Expand
2005
2005
Analytic Models and Empirical Search: A Hybrid Approach to Code Optimization
Arkady Epshteyn
,
M. Garzarán
,
+5 authors
K. Pingali
International Workshop on Languages and Compilers…
2005
Corpus ID: 10194163
Compilers employ system models, sometimes implicitly, to make code optimization decisions. These models are analytic; they…
Expand
2003
2003
Visualising Dynamic Programming
Conan Wang
,
Amir Michail
2003
Corpus ID: 8519289
In this paper, we demonstrate another approach with visualisation. The concepts of a game, combined with the use of colours (or…
Expand
Review
2001
Review
2001
A survey of alternative designs for a search engine storage structure
Andrea Garratt
,
M. Jackson
,
P. Burden
,
J. Wallis
Information and Software Technology
2001
Corpus ID: 28422537
1995
1995
A tight lower bound for searching a sorted array
A. Andersson
,
J. Håstad
,
O. Petersson
Symposium on the Theory of Computing
1995
Corpus ID: 14641810
We show that given a k-character query string and an ai-ray of n strings arranged in alphabetical order, finding a matching…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE