internal sorting

internal sorting

[in′tərn·əl ′sȯrd·iŋ]
(computer science)
The sorting of a list of items by a computer in which the entire list can be brought into the main computer memory and sorted in memory.
McGraw-Hill Dictionary of Scientific & Technical Terms, 6E, Copyright © 2003 by The McGraw-Hill Companies, Inc.
References in periodicals archive ?
The internal sorting operations were moved to the Ohme Gardens area, again, in Wenatchee.
An interesting corollary comes from applying the bound for sorting in Theorem 3.1 to the case M = 2 and B = P = 1, where the number of I/Os corresponds to the number of comparisons needed to sort N records by a comparison-based internal sorting algorithm.

Full browser ?