JamesFlare/CSCI-1200
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

adding underscore

Browse Source
This commit is contained in:
Jidong Xiao
2023-10-02 10:40:44 -04:00
parent 1e16aabb4b
commit 5ce39c98f5
1 changed files with 3 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
lectures/10_linked_lists/README.md
View File

@@ -1,6 +1,6 @@
# Lecture 10 --- Vector Iterators & Linked Lists # Lecture 10 --- Vector Iterators & Linked Lists
- Implementation of iterators in our homemade Vec class (from Lecture 7) - Review of iterators
- Building our own basic linked lists: - Building our own basic linked lists:
– Stepping through a list – Stepping through a list
– Push back – Push back
@@ -191,7 +191,7 @@ of the memory addresses aren’t usually meaningful.
– We will need a separate, local pointer variable to point to nodes in the list as we access them. – We will need a separate, local pointer variable to point to nodes in the list as we access them.
– We will need a loop to step through the linked list (using the pointer variable) and a check on each value – We will need a loop to step through the linked list (using the pointer variable) and a check on each value
## 10.8 Exercise: Write is there ## 10.8 Exercise: Write is_there
```cpp ```cpp
template <class T> bool is_there(Node<T>* head, const T& x) { template <class T> bool is_there(Node<T>* head, const T& x) {
@@ -206,7 +206,7 @@ template <class T> bool is_there(Node<T>* head, const T& x) {
} }
``` ```
- If the input linked list chain contains n elements, what is the order notation of is there? - If the input linked list chain contains n elements, what is the order notation of is_there?
## 10.9 Basic Mechanisms: Pushing on the Back ## 10.9 Basic Mechanisms: Pushing on the Back