Results 241 to 250 of about 177,412 (290)
Some of the next articles are maybe not open access.
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.
openaire +1 more source
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.
openaire +1 more source
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.
openaire +1 more source
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.
openaire +1 more source
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 +1 more source
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 ...
openaire +1 more source
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 ...
openaire +1 more source
2017
Many efficient algorithms are based on sorting the input data, because sorting often makes solving the problem easier. This chapter discusses the theory and practice of sorting as an algorithm design tool. Section 4.1 first discusses three important sorting algorithms: bubble sort, merge sort, and counting sort. After this, we will learn how to use the
openaire +1 more source
Many efficient algorithms are based on sorting the input data, because sorting often makes solving the problem easier. This chapter discusses the theory and practice of sorting as an algorithm design tool. Section 4.1 first discusses three important sorting algorithms: bubble sort, merge sort, and counting sort. After this, we will learn how to use the
openaire +1 more source
1993
Abstract In this section we will discuss some important parallel sorting algorithm. We have already seen one sorting algorithm at the end of§ 2 in chapter II. That algorithm sorted n numbers in time O(lg2n) using 0( n) processors. The theoretical lower bound in time for sorting n numbers is O(lg n) (since this many comparisons must be
openaire +1 more source
Abstract In this section we will discuss some important parallel sorting algorithm. We have already seen one sorting algorithm at the end of§ 2 in chapter II. That algorithm sorted n numbers in time O(lg2n) using 0( n) processors. The theoretical lower bound in time for sorting n numbers is O(lg n) (since this many comparisons must be
openaire +1 more source
Searching and Sorting Algorithms
1999There are many algorithms that are basic to computing in any technical discipline. Some of these are routinely included as part of an introductory computer science course. Some are of interest to particular areas of science and engineering. Others fall under the general category of numerical analysis algorithms; these will be covered separately in ...
openaire +1 more source
Iterative Searching and Sorting
2002Probably the most important algorithms in all of computer science are the searching and sorting algorithms. They are important because they are so common. To search for an item is to know a key value and to look it up in a list. For example, when you look up a word in a dictionary or look up a phone number in a phone book based on a person’s name you ...
openaire +1 more source
Incomplete lineage sorting and phenotypic evolution in marsupials
Cell, 2022Shaohong Feng, Ming Bai, Shi-Ping Liu
exaly
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