| 摘要 |
PURPOSE:To uniform performance of insertion by abstracting the first of main area directly as information with the highest priority and performing comparison and transfer of maximum n times for preparation of insertion after the abstraction if number of information with two raised to n exist. CONSTITUTION:After abstracting the first of the main area A as the information with the highest priority, make the origin of entry point being J under the condition that the Ith key is smaller than J and K when J equals to I*2 and K equals to I*2 + 1, to prepare insertion of information. If a key inserted is larger than the Ith key, it is inserted in the Jth. If it is smaller than that, I is transferred to J. This is repeated for maximum n times for number of information with two raised n. Whatever the abstraction and insertion of infor mation is done for synchronous or asynchronous, this permits effective prepara tion of insertion with minimum number of comparison and transfer.
|
