Results 281 to 290 of about 185,887 (355)
Some of the next articles are maybe not open access.
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 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 ...
David R. Brooks
openaire +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
Sorting, Approximate Sorting, and Searching in Rounds
SIAM Journal on Discrete Mathematics, 1988The worst case number of comparisons needed for sorting or selecting in rounds is considered. The following results are obtained. (a) For every fixed \(k\geq 2\), \(\Omega (n^{1+1/k}(\log n)^{1/k})\) comparisons are required to sort n elements in k rounds. \((O(n^{1+1/k}\log n)\) are known to be sufficient.) This improves the previously known bounds by
Alon, Noga, Azar, Yossi
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.
openaire +2 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.
openaire +2 more sources
2020
Let a1, . . . ,an be a finite sequence. The elements of the sequence should be elements of an ordered set. The order relation is ≤.
openaire +1 more source
Let a1, . . . ,an be a finite sequence. The elements of the sequence should be elements of an ordered set. The order relation is ≤.
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