Research on Data Structure-Oriented Performance of the Expert-Chosen Algorithm

摘要

For the complex constraints and large set of input data, we analyze the expert-chosen algorithm and its physical characteristics like data storage, exchange and operation. Based on three different data structures, we study the performance and resource consumption of the algorithm. The experimental results show that the associative arrays are more suitable for the physical characteristics of the algorithm and the implementation has an obvious speed advantage and can improve system resource utilization.