Results 271 to 280 of about 31,167 (325)

9. Searching and Sorting

Programming in C++, 2019
exaly   +2 more sources

Searching and sorting real numbers

Journal of Algorithms, 1981
G. Ehrlich
openaire   +3 more sources

Searching and Sorting

2009
Frank Nielsen
openaire   +2 more sources

Searching and Sorting

2005
K. Bowman
openaire   +2 more sources

Performance Analysis of Sorting and Searching Algorithms

International Research Journal on Advanced Engineering and Management (IRJAEM)
In computer science, the efficiency of algorithms is a critical consideration for optimizing performance.  The time and space complexity of sorting and searching algorithms, which are essential to a variety of computational tasks, is frequently the basis
Prof.Mrs. Tejaswini.A, Puranik
semanticscholar   +1 more source

Sorting by search intensity

Journal of Economic Theory, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Sorting, Searching, and Simulation in the MapReduce Framework

International Symposium on Algorithms and Computation, 2011
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 ...
M. Goodrich, Nodari Sitchinava, Qin Zhang   +2 more
semanticscholar   +1 more source

Sorting and Searching

2018
Ian Chivers, Chivers Ian, Sleightholme Jane   +2 more
exaly   +2 more sources

Sorting and searching revisted

1996
We discuss the complexity of sorting and searching from the following point of view: The n keys are binary strings (or integers) of length w and the employed computer has word size w. In this natural setting, and assuming that a traditional instruction set is available, a comparison-based algorithm is not the obvious choice.
openaire   +1 more source

Sorting and Searching

1994
For a collection of data objects, we have discussed some data organizing techniques that use array, linked list, stack, queue, tree, and graph objects (to be discussed later). Such basic operations as insertion, deletion, and even searching for these objects were discussed and implemented. A wise selection of one or more such objects for an application
Saumyendra Sengupta, Carl Phillip Korobkin   +1 more
openaire   +1 more source