reading-notes

Linked Lists

Resources

Read and save for reference: Big O: Analysis of Algorithm Efficiency (Up through the section titled “Linear Complexity Growth”)

Read: Linked Lists

Read: What’s a Linked List, Anyway pt1

Read: What’s a Linked List, Anyway pt2

Assignment

To turn in your reading “Reply” to this discussion by teaching something that you learned. Then review what one of your classmates learned, and leave a comment.

Some ideas for how you might want to teach: