JPH07191826A - Sorting method for list body structure - Google Patents

Abstract

PURPOSE:To provide the method for shortening exchanging processing to sort a list body structure. CONSTITUTION:The addresses of the list body structure are successively temporarily registered on a repetition table provided with exponents corresponding to sort item values at respective items. On the other hand, the sort item values of the same value are linked and registered inside the start and end addresses.of the item of the same exponent while switching the linkage. Then, processing from the head of the list body structure to the end is performed while utilizing the exponents of the repetition table and by switching the list body structure, sort processing is shortened.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a list structure sorting method for sorting linked list structures according to their sort item values.

[0002]

2. Description of the Related Art Each of linked list structures may be sorted according to a specific sort item value. For example, an example is a case where the student data having a list structure is sorted and sorted in a certain grade order.

A conventional list structure sorting method will be described with reference to the drawings. Referring to FIG. 7 showing the procedure of the conventional method, the concatenated list structure illustrated in FIG. 4 is sorted.

First, the list structure 2 at the head of FIG.
An address 210 indicating that 20 is the start address
, An address 221 for storing the list structure itself, an address 222 for the next list structure, and a sort item value 22.
3 and.

Further, the list structures 230, 240, 25
0, 260, 270 are respectively represented by the address storing the list structure itself, the address of the next list structure, and the sort item value, and the connected state is shown in FIG. A conventional sorting method will be described with reference to FIG. 7 showing a conventional sorting method and with reference to FIG. 8 for explaining sorting.

In FIG. 9, item numbers 210, 220 and 23
0, 240, 250, 260 and 270 are item numbers 21 in FIG.
0,220,230,240,250,260,270
Shows the same list structure as. When the linked list structures 210 to 270 are linked from the beginning and sorting is started, first, no sorting is set for the presence or absence of sorting (step 71 in FIG. 7). Next, the list structure 220 indicated by the start address of the list structure is referred to. List structure 220
The list structure 230 indicated by the address 222 of the list structure next to is found.

Referring to FIG. 8A, the list structure 2
List structure 2 pointed to by "100" at the start address of 20
20 is read as the first item (step 72), and further, the list composition 230 pointed to by "110" of the address 222 of the next list structure is read (step 73).

List structure 220 and list structure 230
The two sort item values are compared, and when the sort item values are not in the forward order but are in the reverse order, the list structure is replaced (step 75).

FIG. 8B shows the state after the list structure is replaced, and the start address 210 of the list structure is set to "11".
“0”, the address “120” of the structure next to the list structure 220, and the address “100” of the structure next to the list structure 230 are set. After the list structure is replaced, the presence / absence of sort is set to "Yes" (step 76). Next, the linked list structures are referred to (step 77), and steps 74 to 78 for changing the reverse order to the normal order are repeated until the end of the list structure is reached (N in step 78).

FIG. 8C shows a situation in which the list structure 240 and the list structure 250 connected next to the list structure 240 are read and referenced.

FIG. 8D shows the state after the replacement of the list structure 240 and the list structure 250. List structure 22
The address of the structure next to 0 is “130”, the address of the list structure next to the list structure 240 is “140”, and the address of the list structure next to the list structure 250 is “1”.
20 ”is registered by replacement.

When the end of the concatenation of the list structures is reached (Y in step 78), steps 71 to 79 are repeated until the presence / absence of sorting is determined. (N in step 79).

FIG. 8E shows a situation in which the replacement is not completed when the list structure is sequentially traced from the head address 210 of the list structure and the end of the list structure is reached. . FIG. 8F shows a situation where the replacement is not completed when the end of the list structure is reached by sequentially tracing the list structure from the situation of FIG. 8E. FIG. 8G shows the completion of sorting by replacement when the list structure is sequentially traced, the presence / absence of sorting is eliminated, and the end of the list structure is reached.

[0014]

In the conventional method for sorting a list structure, since the concatenation of the list structures is repeatedly traced and the places where the sort item values are in the reverse order are rearranged,
When the total number of list structures is N, the N list structures are referenced from the beginning to the end, and the maximum number of replacements of the list structures is N times. In other words, the computer requires a great deal of execution steps and processing time.

[0015]

SUMMARY OF THE INVENTION An object of the present invention is to provide a method for shortening the sorting process by reordering concatenated list structures in the order of sort item values.

Therefore, in the list structure sorting method of sorting the list structure having, as data, the address of the next list structure indicating the connection destination and the sort item value, in the sorting method of the list structure, the lower limit value of the list structure To the upper limit, the initialization procedure that creates a repeating table that registers the start address and end address for each item that has an index corresponding to the sort item value, and when the list structure is sequentially linked from the beginning, the list If the start and end addresses are not registered in the index item corresponding to the sort item value of the structure, the address that stores the list structure itself is registered in the start and end addresses of the index item, and the index If the start address and end address are already registered in the item, the end address of the index item Refer to the list structure pointed to by, register the address that stores the referenced list structure itself to the address of the list structure next to the list structure already registered in the index item, and Register the address that stores the referenced list structure itself in the end address, trace the concatenation to the end, and register the address that stores the list structure in the index item of the repeat table in the start address and end address, respectively. Repeat table creation procedure and determine whether or not an address is registered in each index item of the repetition table in order from the first index, and set the start address of the first index item in which the address is registered to the first address. Register, refer to the list structure pointed to by the first address, and change from the index item to the index item whose address is registered next. The start address is registered in the address of the list structure next to the reference structure, the list structure pointed to by the end address of the index item is referenced, and the address is registered next from the index item. For the index item, register it at the address of the list structure next to the list structure that refers to its start address, trace to the end of the index in the repetition table, and at the end of the index, refer to the last list A list structure pair creating procedure for registering an end at the address of the list structure next to the structure.

[0017]

DESCRIPTION OF THE PREFERRED EMBODIMENTS The present invention will be described with reference to the drawings.

Flowchart 1 showing the procedure of one embodiment of the present invention
The embodiment will be described with reference to FIG.

First, FIG. 4 shows a concatenated list structure. The start address 210 of the list structure indicating the beginning of the concatenation, the list structure 220 stores an address 221 for storing itself, and the next list structure. Address 222 and sort item value 223. List structure 23
0, 240, 250, 260 and 270 are respectively represented by the address of the list structure itself, the address of the next list structure and the sort item value.

FIG. 5 is a repeating table 30 in which the list structure is registered in association with the indexes in the order of the sort item values. The repetition table 30 has items for registering an index 31, and a start address 32 and an end address 33.

Referring to the flow chart 6 for explaining the procedure of this embodiment, item numbers 210, 220, 230, 240 and 25 are shown.
0, 260, 270 are item numbers 210, 220, 23 in FIG.
0, 240, 250, 260, 270 shows the same list structure, and item number 30 shows the same repetition table as item number 30 of FIG.

The operation of the embodiment will be described with reference to the flow chart 1 showing the procedure of this embodiment and FIGS. 2 and 3 showing the detailed procedure of the flow chart 1.

First, the index and the item corresponding to each value from the lower limit value to the upper limit value of the sort item value of the list structure are set, and initialization is performed to create the repeating table 30 (step of FIG. 1). Next, the start address 2 of the list structure
The list structure 220 indicated by 10 is read as the first item (step 2). When the start address and the end address are not set in the item of the index “4” of the repeating table 30 corresponding to the sort item value “4” of the list structure 220 (N in step 3), the index “4” of the repeating table 30. The address is registered in the item (step 4).

FIG. 6A shows the start address of the item of index "4" of the repetition table 30 corresponding to the sort item value "4" of the list structure 220 indicated by "100" of the start address 210 of the list structure. 32 and end address 3
The address “100” of the list structure 220 is registered in No. 3.

Next, when the start address and the end address have been registered in the item of the index corresponding to the sort item value (Y in step 3), the list structure replacement process 1 is performed (step 5). Referring to FIG. 6B with reference to the flowchart 2 showing the replacement process 1, the sort item value “3” of the list structure 250 pointed to by the address “130” of the list structure next to the list structure 240 is Since the address “110” has already been registered as the start address and the end address of the index “3” in the repeating table 30 shown (Y in step 3 and step 5a), the list structure pointed to by the end address “110” of the index “3” The address "130" for storing the list structure 250 is registered in the address of the list structure next to the body 220 (step 5b), and the list structure 2
The address "130" of the list structure 250 is registered in the end address of the index "3" indicated by the sort item value "3" of 50 (step 5c). The list structure is sequentially traced (step 6), the address is registered in each index item of the repetition table 30, and the process is repeated until the address of the list structure next to the final list structure indicates the end (step N).

FIGS. 6 (c) and 6 (d) show a state in which all the addresses have been registered in the repetition table 30 for the list structure. List structure 220, 240, 2 having only one list structure for sort item values
As for 60270, the addresses for storing the list structure itself are registered in the start address and the end address of the index item corresponding to the sort item value of the list structure.

For the list structures 230 and 250 having a plurality of list structures corresponding to sort item values, the address "130" for storing the list structure 250 is registered at the address of the list structure next to the list structure 230. Is
At the start address of sort item value "3", list structure 2
The address "110" for storing 30 and the address "130" for storing the list structure 250 are registered in the end address.

In the repetition table 30 shown in FIG. 6D, with the address registration completed, "1" is then registered in the index (step 8), and the start address in the index "1" of the repetition table 30 is registered. Register as the top address (step 11).

In FIG. 6E, the head address “140” is registered in the start address and end address of the index “1” of the repetition table 30. Then, the list structure pointed to by the end address is referenced (step 12). Furthermore,
The index "1" is updated to "2" (step 13), and since the address is registered in the index "2" of the repetition table 30 (Y of step 14), the list structure replacement processing 2 is performed (step). 15). List structure replacement processing 2
The replacement of the list structure will be described with reference to the flow chart 3 of FIG. 3, in which the index "3" is added to the address of the list structure 270 next to the end address "150" of the index "2" of the repetition table. The start address "110" of "" is set (step 15a). Then, the list structure pointed to by the end address is referenced (step 15b). When the index of the repetition table 30 is not the end (Y of step 16), the index is updated (step 13), and the start address and end address replacement processing 2 of the index next to the updated index is performed (step 15). When the end of the index is reached (N in step 16), the end of the list structure is registered at the address of the list structure next to the last referenced list structure (step 1).
7).

In FIG. 6 (g), the end is set to the address of the list structure next to the list structure 240 pointed to by the end address "120" indicated by the index "5" of the repetition table.

FIG. 6 (h) shows a situation in which the list structures have been sorted and the sorting has been completed in the order of the sorted item values. "14" at the start address 210 of the list structure
0 ”points to the list structure 260, and the list structure 260
The address "150" of the next list and structure points to the list structure 270, the list structures are replaced and connected in the ascending order of the sort item values of each list structure, and The end is stored at the address of the list structure.

[0032]

As described above, according to the present invention,
Since the address of the list structure is temporarily registered at the relative position of the repetition table corresponding to the sort item value and the list structure is replaced using the repetition table,
When the number of list structures is N, the number of times from the beginning to the end is 1 to register the list structure, and the number of replacement parts of the list structure is N at the maximum, so the order is N. Can be exchanged.

Compared with the conventional method, the execution steps on the computer are greatly reduced.

[Brief description of drawings]

FIG. 1 is a flow chart showing a procedure of an embodiment of the present invention.

FIG. 2 is a flowchart showing a replacement process 1 of FIG.

FIG. 3 is a flowchart showing a replacement process 2 of FIG.

FIG. 4 is a diagram illustrating a concatenated list structure.

FIG. 5 is a diagram illustrating a repetition table.

6A and 6B are diagrams for explaining a list structure replacement process and a replacement process 2, respectively.

FIG. 7 is a flowchart showing a conventional method for sorting a list structure.

8A to 8G are diagrams for explaining a conventional sorting method.

[Explanation of symbols]

210 start address of list structure 220, 230, 240, 250, 260, 270
List structure 221 List structure address 222 Next list structure address 223 List structure sort item value 30 Repeating table 31 Repeating table index 32 Start address 33 End address

Claims (1)

[Claims] 1. A list structure sorting method for sorting a list structure having, as data, an address and a sort item value of a next list structure pointing to a concatenation destination, in a sort method of a list structure, a lower limit value of the list structure. To the upper limit, the initialization procedure that creates a repeating table that registers the start address and end address for each item that has an index corresponding to the sort item value, and when the list structure is sequentially linked from the beginning, the list If the start and end addresses are not registered in the index item corresponding to the sort item value of the structure, the address that stores the list structure itself is registered in the start and end addresses of the index item, and the index If the start address and end address are already registered in the item, the end address of the index item points Register the address that stores the referenced list structure itself to the address of the list structure next to the list structure that was already registered in the index item by referring to the list structure, and the end address of the index item , Register the address that stores the referenced list structure itself, trace the concatenation to the end, and register the address that stores the list structure itself in the index item of the repeat table at the start address and end address, respectively. The table creation procedure and whether or not an address is registered in each index item of the repetition table are determined in order from the first index, and the start address of the first index item in which the address is registered is registered in the first address. , Refer to the list structure pointed to by the start address, and add the start address of the index item whose address is registered next from the index item. The index that is registered at the address of the list structure next to the list structure that refers to the index, refers to the list structure pointed to by the end address of the index item, and has the address registered next from the index item. For the item of, the start address of the list structure is registered at the address of the list structure next to the list structure, and the list structure is traced to the end of the index in the repetition table, and at the end of the index, the list structure last referenced A method for sorting a list structure, characterized by including a procedure for creating a list structure that registers an end at the address of the next list structure in the field, and.