Results 191 to 200 of about 196,748 (236)

Sublinear merging and natural mergesort

Algorithmica, 1990
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Carlsson, Svante, Levcopoulos, Christos, Petersson, Ola   +2 more
openaire   +1 more source

A hardware sort-merge system

IBM Journal of Research and Development, 1985
A hardware sort-merge system which can sort large files rapidly is proposed. It consists of an initial sorter and a pipelined merger. In the initial sorter, record sorting is divided into two parts: key-pointer sorting and record rearranging. The pipelined merger is composed of several intelligent disks each of which has a simple processor and some ...
N. Takagi, C.-K. Wong
openaire   +1 more source

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 ...
null De-Lei Lee, K.E. Batcher
openaire   +1 more source

Sorting and Merging

2014
If there is one thing you should have learned from the chapters on sequential files, it is that your processing options are very limited if a sequential file is not ordered. Solutions based on control breaks, and the file-update problem, are impossible unless the file is ordered on some key field.
openaire   +1 more source

Algorithm 426: Merge sort algorithm [M1]

Communications of the ACM, 1972
Sorting by means of a two-way merge has a reputation of requiring a clerically complicated and cumbersome program. This ALGOL 60 procedure demonstrates that, using recursion, an elegant and efficient algorithm can be designed, the correctness of which is easily proved [2].
openaire   +2 more sources

Stochastic Analysis of ‘Simultaneous Merge–Sort'

Advances in Applied Probability, 1997
The asymptotic behaviour of the recursion is investigated; Yk describes the number of comparisons which have to be carried out to merge two sorted subsequences of length 2k–1 and Mk can be interpreted as the number of comparisons of ‘Simultaneous Merge–Sort'.
openaire   +3 more sources

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   +2 more sources

Comparison of Merge Sort With a New Tri- Merge Sorting Algorithm

The sorting problem is one of the most fundamental problems in computer science. This paper is concerned with a new Tri-merge sorting algorithm. This is a modification of Merge sort. It is competitive with the fastest shorting algorithms, especially when the number of elements to be sorted is too large. Compared with the preceding Merge sort, Tri-merge
Nayeem, Jannatun, Salek, Md. Abu
openaire   +1 more source

Sorting, Searching, and Merging

2013
In this chapter, we will explain the following: How to sort a list of items using selection sort How to sort a list of items using insertion sort How to add a new item to a sorted list so that the list remains sorted How to sort an array of strings How to sort related (parallel) arrays How to search a sorted list using ...
openaire   +1 more source

Merge Sort

2012
Michael McCool, Arch D. Robison, James Reinders   +2 more
openaire   +1 more source