| 摘要 |
PROBLEM TO BE SOLVED: To minimize the performance lowering at the time of memory compression, by sorting and selecting array elements according to a sorting algorithm for arranging the array elements in a memory space and updating one array element following the selected array element in the array in response to alteration of the selected array element. SOLUTION: A static sorting algorithm or dynamic sorting algorithm is used to store the array 5 including array elements A to F in the memory space according to an increasing frequency of alteration. Then, when the array element C is deleted from the array 5, the following array elements D to F in the array are moved to the left in the memory so as to maintain a continuous memory space as shown by an array 5'. Further, when the array C is increased in size, the array elements D to F are moved to the right in the memory as shown by an array 5". Further, when a new array element G is added behind the array element C, array elements D to F of an array 5"' are moved to the right.
|
