Results 241 to 250 of about 25,195 (291)
Some of the next articles are maybe not open access.
Sorting and searching on the word RAM
Lecture Notes in Computer Science, 1998A word RAM is a unit-cost random-access machine with a word length of w bits, for some w, and with an instruction repertoire similar to that found in present-day computers. The simple lower bounds for the problems of sorting and searching valid in the comparison-based model do not hold for the word RAM, so that the well-known algorithms for these tasks
Torben Hagerup
exaly +5 more sources
2012
Typical computer science students study the basic sorting algorithms at least three times before they graduate:first in introductory programming,then in data structures, and finally in their algorithms course.
Steven Skiena
exaly +3 more sources
Typical computer science students study the basic sorting algorithms at least three times before they graduate:first in introductory programming,then in data structures, and finally in their algorithms course.
Steven Skiena
exaly +3 more sources
2019
Searching data and sorting through data are fundamental algorithms. Searching refers to iterating over the data structure’s elements to retrieve some data. Sorting refers to putting the data structure’s elements in order. The searching and sorting algorithms are different for every data structure.
exaly +2 more sources
Searching data and sorting through data are fundamental algorithms. Searching refers to iterating over the data structure’s elements to retrieve some data. Sorting refers to putting the data structure’s elements in order. The searching and sorting algorithms are different for every data structure.
exaly +2 more sources
Optimal resilient sorting and searching in the presence of memory faults [PDF]
Theoretical Computer Science, 2009 We investigate the problem of reliable computation in the presence of faults that may arbitrarily corrupt memory locations. In this framework, we consider the problems of sorting and searching in optimal time while tolerating the largest possible number ...
Irene FINOCCHI +2 more
exaly +2 more sources
Historical searching and sorting
1991A ‘move to the front’ dictionary data structure that supports O(log t) time access to objects last accessed t operations ago is described. This ‘Historical Search Tree’ is then used in two adaptive sorting algorithms. The first algorithm, ‘Historical Insertion Sort’, exploits the temporal locality present in a nearly sorted list rather than the more ...
Alistair Moffat, Ola Petersson
openaire +2 more sources
Journal of Economic Theory, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
2021
In this chapter, we will explore two fundamental problems that are the foundations of many other algorithms: sorting sequences and searching for an element in them. These are central problems used as building blocks for a variety of other algorithms, and Python already has built-in functionality for solving them.
openaire +2 more sources
In this chapter, we will explore two fundamental problems that are the foundations of many other algorithms: sorting sequences and searching for an element in them. These are central problems used as building blocks for a variety of other algorithms, and Python already has built-in functionality for solving them.
openaire +2 more sources
Sorting and searching revisted
1996We 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
Searching, Sorting and Merging
2015In this chapter, we will explain the following: How to search a list using sequential search How to sort a list using selection sort How to sort a list using insertion sort How to sort a list of strings How to sort parallel arrays How to search a sorted list using binary search How to merge two sorted ...
openaire +1 more source