From f9d59b26faaa01647796db3f41cb2eac4ee38159 Mon Sep 17 00:00:00 2001 From: Jidong Xiao Date: Thu, 28 Sep 2023 23:34:16 -0400 Subject: [PATCH] adding erase animation' --- lectures/09_iterators_linked_lists/README.md | 5 ++--- 1 file changed, 2 insertions(+), 3 deletions(-) diff --git a/lectures/09_iterators_linked_lists/README.md b/lectures/09_iterators_linked_lists/README.md index 55e31a4..9d7f9e8 100644 --- a/lectures/09_iterators_linked_lists/README.md +++ b/lectures/09_iterators_linked_lists/README.md @@ -42,9 +42,8 @@ erase_from_vector, pop_back, and push_back. When items are continually being inserted and removed, vectors are not a good choice for the container. - Instead we need a different sequential container, called a list. - This has a “linked” structure that makes the cost of erasing independent of the size. -- We will move toward a list-based implementation of the program in two steps: - - Rewriting our classlist vec.cpp code in terms of iterator operations. - - Replacing vectors with lists + +- Play this [animation](https://jidongxiao.github.io/CSCI1200-DataStructures/animations/lists/erase/index.html) to see why list is better than vector in terms of the erase operation. ## 9.4 Iterators