double-list sorting
(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.
(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.
Join the WikiAnswers Q&A community. Post a question or answer questions about "double-list sorting" at WikiAnswers.
Copyrights:
![]() | Sci-Tech Dictionary. McGraw-Hill Dictionary of Scientific and Technical Terms. Copyright © 2003, 1994, 1989, 1984, 1978, 1976, 1974 by McGraw-Hill Companies, Inc. All rights reserved. Read more |