Results 281 to 290 of about 31,167 (325)
Some of the next articles are maybe not open access.
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
Energy Efficient Sorting, Selection and Searching
Workshop on Algorithms and Computation, 2023Varunkumar Jayapaul +3 more
semanticscholar +1 more source
Current Opinion in Biotechnology
High-throughput screening technologies have been lacking in comparison to the plethora of high-throughput genetic diversification techniques developed in biotechnology. This review explores the challenges and advancements in high-throughput screening for
Eloise O’Connor +2 more
semanticscholar +1 more source
High-throughput screening technologies have been lacking in comparison to the plethora of high-throughput genetic diversification techniques developed in biotechnology. This review explores the challenges and advancements in high-throughput screening for
Eloise O’Connor +2 more
semanticscholar +1 more source
Searching in a Sorted Linked List
2018 International Conference on Information Technology (ICIT), 2018Let A be the array of n integers in {0, 1, …, n-1}. A tree is constructed in O(nloglogm/p+loglogm) time with p processors based on the trie with all the given integers. Additional nodes (O(nloglogm) of them) are added to the tree. After the tree is construct we can, for any given integer, find the predecessor and successor of this integer, insert or ...
Hemasree Koganti, Yijie Han
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
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
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
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
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