| 释义 |
entry sorting entry sorting[′en·trē ‚sȯrd·iŋ] (computer science) A method of internal sorting in which records or blocks of records are placed, one at a time, in a buffer area and then integrated into the sorted list before the next record is placed in the buffer. |