Week 6 Day 2 - Linked Lists Part III

Channel:

Bill Kerney

Subscribers:

2,640

Published on February 20, 2021 12:02:58 AM ● Video Link: https://www.youtube.com/watch?v=BLJ6AkVzFkg

Duration: 1:35:19

202 views

2

First we talked about how to debug problems with your code when you're working with pointers. You're going to seg fault at some point, and so learning how to use ASAN (address sanitizer) and GDB (GNU Debugger) will be lifesavers.


Today we got into more complicated linked list functions. We implemented the following:
1) Find - searches through the list to see if an element is in it or not
2) InsertAfter - adds a new person to the list after a specified name


It's really important to read through your textbook so you understand conceptually what is happening, and before you write code with Linked Lists, to sketch it out on paper. Every time you erase a line or change where something is pointed... turn that into a line of code! And if you don't know how to convert an arrow on paper into a line of code, it's probably better to ask rather than guessing. If you don't have a good conceptual understanding, your code will be bad, and you'll feel sad.