An internal sort is any data sorting process that takes place entirely within the main memory of a computer. This is possible whenever the data to be… (More)

Semantic Scholar uses AI to extract papers important to this topic.

2012

2012

- Niraj Kumar Singh, Soubhik Chakraborty
- ArXiv
- 2012

Smart Sort algorithm is a “smart” fusion of heap construction procedures (of Heap sort algorithm) into the conventional… (More)

Is this relevant?

2002

2002

- David Taniar, J. Wenny Rahayu
- Inf. Sci.
- 2002

Sorting in database processing is frequently required through the use of Order By and Distinct clauses in SQL. Sorting is also… (More)

Is this relevant?

2000

2000

- Shin-Jae Lee, Minsoo Jeon, Andrew Sohn, Dongseung Kim
- ISHPC
- 2000

Load balanced parallel radix sort solved the load imbalance problem present in parallel radix sort. By redistributing the keys in… (More)

Is this relevant?

1985

1985

- Philip J. Janus, Edmund A. Lamagna
- IEEE Transactions on Computers
- 1985

Distributive Partitioned Sort (DPS) is a fast internal sorting algorithm which rung in O(n) expected time on uniformly… (More)

Is this relevant?

1966

1966

- M. Donald MacLaren
- J. ACM
- 1966

A method is proposed for internal sorting which has the property that the expected time required per record, to sort n records… (More)

Is this relevant?

1963

1963

- Martin A. Goetz
- Commun. ACM
- 1963

A general technique for sequencing unsorted records is presented. The technique is shown to be applicable for the first stage of… (More)

Is this relevant?

1962

1962

- Sheldon Sobel
- J. ACM
- 1962

Oscillating Sort, designed to gain an (N-1)-way merge with N merging tapes available, is further speeifieaUy designed for read… (More)

Is this relevant?

1961

1961

- Ivan Flores
- J. ACM
- 1961

The purpose of this paper is to describe and discuss the methods available for sorting information within a computer using its… (More)

Is this relevant?

Review

1959

Review

1959

- Donald L. Shell
- Commun. ACM
- 1959

There are a number of methods that have been used for sorting purposes in various machine programs from time to time. Most of… (More)

Is this relevant?

1959

1959

- Paul Hildebrandt, Harold Isbitz
- J. ACM
- 1959

This note describes a new technique—Radix Exchange—for sorting data internal to the high speed memory of an electronic binary… (More)

Is this relevant?