Linked list implementing method for quickly searching data

Abstract

The invention relates to an implement method that searches linked list of data rapidly. The technical problem that needs to solve is that not only the advantages of an array and a linked list are maintained, but also limitations of use thereof are overcame. The implementations lie in that appointing a data item of each node in the linked list to an array space; each element in the array appointed by the data item has a unique index number; the linked list can be a signal linked list or a double linked list; the array can be dynamically distributed array or appointed array. The data in the entire linked list is stored in sequence. The array is combined with the linked list, which is capable of enhancing the number of the nodes of the linked list to realize the dynamical array. Because of each node appoints to an array space that appoints size, but not a data item only, the function of the double linked list is extended and frequently distribution and waste of the memory are avoided too. Storing after ordering the entire data to position the data rapidly by dichotomy is convenient to operate.

Description

Technical field: [0001] The invention relates to a computer system, in particular to a linked list implementation method for fast data retrieval. Background technique: [0002] With the rapid development of computer technology, especially the development of embedded systems, in order to speed up the processing speed of the system, more and more data to be processed need to be stored in the system memory in large quantities, which requires a convenient memory Data maintenance operations to meet various data processing needs. [0003] The common linked list structure in the prior art is not comprehensive enough, and the data items of its nodes generally point to a specific data. At the same time, when too many nodes in the linked list are created, there will be too many system memory allocation operations. With the continuous allocation and release of nodes, it is easy to cause a large amount of memory fragmentation, which makes the system inconvenient to run. This needs to b...

AI Technical Summary

Problems solved by technology

[0003] The ordinary linked list structure in the prior art is not comprehensive enough, and the data items of its nodes generally point to a specific data

At the same time, when too many nodes in the linked list are created, there will be too many system memory allocation operations. With the continuous allocation and release of nodes, it is easy to cause a large amount of memory fragmentation, which makes the system inconvenient to run. This needs to be avoided in system operation.

At the same time, due to too many nodes in the linked list, the speed of retrieving data drops sharply, and the operating efficiency is poor.

Therefore, when the amount of data is large, it is not advisable to use a linked list

[0004] At the same time, due to the large limitations of ordinary arrays, they must be allocated first when the system is initialized or the function is initialized, and cannot be dynamically allocated and released. Its flexibility is poor and it will cause large memory overhead.

[0005] Although the dynamic allocation of memory in the prior art can solve the shortcomings of ordinary arrays, the dynamic allocation and use during use reduces the overhead of system memory and expands the flexibility of ordinary arrays. It is very inconvenient to maintain

Images