一种以空间换时间的快速查找算法的设计与应用

The Design and Application of Search Algorithms Based on Trading Space for Time

针对数据结构中三种静态查找算法使用条件或效率的限制,结合项目中遇到的具体问题,提出了一种以空间换时间的替代算法。解决了查找耗时的效率难题,满足了交互软件需快速响应的要求。阐述了该算法的设计原理和应用背景。从时间和空间的角度比较了该算法与其他算法的优缺点,得出该算法更适合解决本文的问题。

In light of the restrictions of working conditions and efficiency in the data structure about three static search algorithms below, the article proposes the search algorithms of space for time, which is also with the specific issue encountered in the project. It solves the time-consuming search problem, and also satisfies the requirement that interactive software need quickly respond to. Simultaneously, this article elaborates on the principle of algorithm design and the application background. Compared with advantages and disadvantages of the algorithm and others from the time and space, the conclusion is that the algorithm is better suited to resolve the issue.