资 源 简 介
In many Algorithms classes students learn the asymptotic complexities of different operations on many different data structures in big-O notation. To younger students this means little. After all, what does it matter that it took N steps to find what I am looking for? It still took only half a second. Most classes take an intrinsic approach when teaching the class. They do a mathematical proof will be done to show the best and worst case analysis.
Another important topic in Algorithms classes is the discussion of data structures and their use. Many students are handed a project and are told "implement a linked list." This gives a student a great understanding of how a linked list works, but not good applications of it.
The goal of this project is to take an extrinsic approach to seeing how a system benefits from optimizing data structures. We already know that an O(1) lookup is much better than an O(N) lookup. With this project we will be able to see how a
