diff options
| author | mo khan <mo.khan@gmail.com> | 2020-05-24 13:18:36 -0600 |
|---|---|---|
| committer | mo khan <mo.khan@gmail.com> | 2020-05-24 13:18:36 -0600 |
| commit | 40a595d57a7ebf6d197a1087d12736d9377cd335 (patch) | |
| tree | 34e42bbb6002f938ed011408a7e65d1c1f286c21 /unit | |
| parent | 6875199be3e74f54776e85e91a9aa9239e01337d (diff) | |
Add links to things to review
Diffstat (limited to 'unit')
| -rw-r--r-- | unit/02/README.md | 7 |
1 files changed, 7 insertions, 0 deletions
diff --git a/unit/02/README.md b/unit/02/README.md index 539f201..00fbdba 100644 --- a/unit/02/README.md +++ b/unit/02/README.md @@ -1,5 +1,7 @@ Study the following sections from Pat Morin’s textbook: +Read: + * 2.1 ArrayStack: Fast Stack Operations Using an Array * 2.2 FastArrayStack: An Optimized ArrayStack * 2.3 ArrayQueue: An Array-Based Queue @@ -7,6 +9,11 @@ Study the following sections from Pat Morin’s textbook: * 2.5 DualArrayDeque: Building a Deque from Two Stacks * 2.6 RootishArrayStack: A Space-Efficient Array Stack +Execute: +* https://www.cs.usfca.edu/~galles/visualization/Algorithms.html +* http://www.cs.usfca.edu/~galles/visualization/StackArray.html +* http://www.cs.usfca.edu/~Egalles/visualization/QueueArray.html + # Chapter 2 - Array-Based Lists Data structures that work by storing data in a single array have common advantages and limitations: |