Results 241 to 250 of about 281,251 (291)

Enhanced Merge Sort- A New Approach to the Merging Process [PDF]

Procedia Computer Science, 2016
One of the major fundamental issues of Computer Science is arrangement of elements in the database. The efficiency of the sorting algorithms is to optimize the importance of other sorting algorithms11. The optimality of these sorting algorithms is judged
Smita Paira, Sourabh Chandra
exaly   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

Sorting and merging on the DAP

Proceedings of the 30th annual Southeast regional conference on - ACM-SE 30, 1992
Summary: The sorting problem is of fundamental importance in non-numerical algorithms. Many applications require the ordering of data based the relationship of some set of keys with in the data. Merging is a natural companion of sorting, and is known to yield a very efficient sorting algorithm in sequential processing.
Dharmavani Bhagavathi, W. M. Denny, Chester E. Grosch, Peter J. Looges, Stephan Olariu   +4 more
openaire   +3 more sources

Sorting and Merging in Rounds

SIAM Journal on Algebraic Discrete Methods, 1982
The need for sorting algorithms which operate in a fixed number of rounds (rather than have each new comparison depend on the outcomes of all previous comparisons) arises in structural modeling. Since all comparisons within a round are evaluated simultaneously, such algorithms have an obvious connection to parallel processing.In an earlier paper (SIAM ...
Haeggkvist, R., Hell, P.
openaire   +1 more source

Merge Sort

2000
exaly   +2 more sources

Heuristic and pattern based Merge Sort [PDF]

Procedia Computer Science, 2011
The aim of this study is to present a stable and adaptable Merge Sort algorithm that uses the design patterns to reduce computational complexity of swaps and memory usage.
Jafarlou, Manouchehr Zadahmad, Manouchehr Zadahmad Jafarlou, Fard, Parisa Yousefzadeh, Parisa Yousefzadeh Fard   +3 more
exaly   +2 more sources

Parallel Merge Sort

SIAM Journal on Computing, 1986
Summary: We give a parallel implementation of merge sort on a CREW PRAM that uses n processors and O(log n) time; the constant in the running time is small. We also give a more complex version of the algorithm for the EREW PRAM; it also uses n processors and O(log n) time. The constant in the running time is still moderate, though not as small.
openaire   +2 more sources

Correction: Parallel Merge Sort

SIAM Journal on Computing, 1993
Correction concerned with ibid. 17, No. 4, 770-785 (1988; Zbl 0651.68077).
openaire   +2 more sources

A multiway merge sorting network

IEEE Transactions on Parallel and Distributed Systems, 1995
A multiway merge sorting network is presented, which generalizes the technique used in the odd-even merge sorting network. The merging network described here is composed of m k-way mergers and a combining network. It arranges k ordered lists of length n each into one ordered lists in T(k)+[log/sub 2/k] [log/sub 2/m] [log/sub 2/m] steps, where T(k) is ...
De-Lei Lee, Kenneth E. Batcher
openaire   +1 more source

Sorting by Merging or Merging by Sorting?

2006
In the comparison model the only operations allowed on input elements are comparisons and moves to empty cells of memory. We prove the existence of an algorithm that, for any set of s ≤n sorted sequences containing a total of n elements, computes the whole sorted sequence using O(nlogs) comparisons, O(n) data moves and O(1) auxiliary cells of memory ...
openaire   +1 more source

Minimean Merging and Sorting: An Algorithm

SIAM Journal on Computing, 1978
A simple partitioning algorithm for merging two disjoint linearly ordered sets is given, and an upper bound on the average number of comparisons required is established. The upper bound is $1.06\log _2 \begin{pmatrix} {n + m} \\ m \end{pmatrix}$, where n is the number of elements in the larger of the two sets, m the number of the smaller, and $\begin ...
openaire   +3 more sources