external sorting


external sorting

[ek¦stərn·əl ′sȯrd·iŋ] (computer science) The sorting of a list of items by a computer in which the list is too large to be brought into the memory at one time, and instead is brought into the memory a piece at a time so as to produce a collection of ordered sublists which are subsequently reordered by the computer to produce a single list.