double-list sorting

double-list sorting

[¦dəb·əl ‚list ′sȯrd·iŋ]
(computer science)
A method of internal sorting in which the entire unsorted list is first placed in one portion of main memory and sorting action then takes place, creating a sorted list, generally in another area of memory.