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.