Results 261 to 270 of about 31,167 (325)
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, Hagerup Torben
exaly +4 more sources
Sorting and Searching in Multisets
SIAM Journal on Computing, 1976In this paper the problem of sorting multisets is considered. An information theoretic lower bound on the number of three branch comparisons is obtained, and it is shown that this bound is asymptotically attainable. It is shown that the multiplicities of a set can only be obtained by comparisons if the total order is discovered in the process.
J. Ian Munro, Philip M. Spira
exaly +2 more sources
2012
This chapter explores two very practical problems: searching and sorting. We consider Linear Search and (two versions of) Binary Search. Binary trees are used to describe the search process. Binary search is much, much better but requires sorted input. We give examples of several sorting strategies: selection sorts, exchange sorts, and partition sorts.
Tom Jenkyns, Ben Stephenson
openaire +2 more sources
This chapter explores two very practical problems: searching and sorting. We consider Linear Search and (two versions of) Binary Search. Binary trees are used to describe the search process. Binary search is much, much better but requires sorted input. We give examples of several sorting strategies: selection sorts, exchange sorts, and partition sorts.
Tom Jenkyns, Ben Stephenson
openaire +2 more sources
2017
The current English meaning of the terms "searching" and "sorting" also holds good in computer science. Sometimes, this is not the case. For example, the current English meaning of the terms "root," "garbage or "tree" is very different from their meaning in computer science.
S. Chavan
openaire +2 more sources
The current English meaning of the terms "searching" and "sorting" also holds good in computer science. Sometimes, this is not the case. For example, the current English meaning of the terms "root," "garbage or "tree" is very different from their meaning in computer science.
S. Chavan
openaire +2 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 S Skiena, Skiena Steven S
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 S Skiena, Skiena Steven S
exaly +3 more sources
1997
This chapter looks at the standard problems of searching an array for a particular value that may be stored in it and of sorting an array. Before tackling these, it is first necessary to consider how to model an array in the language.
Derek Andrews
openaire +2 more sources
This chapter looks at the standard problems of searching an array for a particular value that may be stored in it and of sorting an array. Before tackling these, it is first necessary to consider how to model an array in the language.
Derek Andrews
openaire +2 more sources
1990
Now that you have learned how to create and edit text files, we can consider in detail processing text already stored in a file. In this chapter we’ll discuss the UNIX programs that allow you to search for text in a file and sort lines of text. In Chapters 14, “Programming with awk,” and 15, “Programming with C,” we’ll discuss the languages that allow ...
D. W. Topham
openaire +2 more sources
Now that you have learned how to create and edit text files, we can consider in detail processing text already stored in a file. In this chapter we’ll discuss the UNIX programs that allow you to search for text in a file and sort lines of text. In Chapters 14, “Programming with awk,” and 15, “Programming with C,” we’ll discuss the languages that allow ...
D. W. Topham
openaire +2 more sources
Searching, Merging, and Sorting in Parallel Computation
IEEE Transactions on Computers, 1983C. Kruskal
exaly +2 more sources
Algorithm Development Analysis: searching and sorting
2022 IEEE International Students' Conference on Electrical, Electronics and Computer Science (SCEECS), 2022The Development and analysis of algorithms are fundamental to all aspects of problem-solving: artificial intelligence, neural networks, fuzzy approaches, networking, operating systems, etc.
V. Chandana +3 more
semanticscholar +1 more source
Visualizing Sequence of Algorithms for Searching and Sorting
Advances in Recent Technologies in Communication and Computing, 2009Bremananth R, Radhika V
exaly +2 more sources