Results 231 to 240 of about 177,412 (290)
Some of the next articles are maybe not open access.
2020
As its title suggests, this chapter also has two parts. The first provides the reader with an introduction to searching – a very important aspect of computing. It introduces the sequential search and describes how to do it in an array as well as in a linked list.
openaire +1 more source
As its title suggests, this chapter also has two parts. The first provides the reader with an introduction to searching – a very important aspect of computing. It introduces the sequential search and describes how to do it in an array as well as in a linked list.
openaire +1 more source
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 +1 more source
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 +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
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 +1 more
openaire +1 more source
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 +1 more
openaire +1 more source
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.
Munro, Ian, Spira, Philip M.
openaire +1 more source
1992
A new neural network parallel algorithm for sorting problems is introduced in this Chapter. The proposed algorithm using 0(n2) processors requires two and only two steps, not depending on the problem size, while the conventional parallel sorting algorithm using O(n) processors proposed by Leighton needs the computation time 0(log n).
openaire +1 more source
A new neural network parallel algorithm for sorting problems is introduced in this Chapter. The proposed algorithm using 0(n2) processors requires two and only two steps, not depending on the problem size, while the conventional parallel sorting algorithm using O(n) processors proposed by Leighton needs the computation time 0(log n).
openaire +1 more source
2010
We give various sorting algorithms and some practical variants of them, like sorting index arrays and pointer sorting. Searching methods both for sorted and for unsorted arrays are described. Finally we give methods for the determination of equivalence classes.
openaire +1 more source
We give various sorting algorithms and some practical variants of them, like sorting index arrays and pointer sorting. Searching methods both for sorted and for unsorted arrays are described. Finally we give methods for the determination of equivalence classes.
openaire +1 more source
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.
openaire +1 more source
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.
openaire +1 more source
Search, Sorting, and Urban Agglomeration
Journal of Labor Economics, 2001Studies have suggested that urban agglomeration enhances productivity by facilitating the firm‐worker matching process. This article develops a model that formalizes this notion and demonstrates that, when firm capital and worker skill are complementary in production, urban agglomeration will tend to generate more efficient, yet segregated matches.
openaire +1 more source