The Actual Difference
Same lecture. Zero chaos.
Drag the slider. That dense, overwhelming slide is what you upload. The calm, structured notebook page is what you get back, in seconds.
Arrays & Lists: Core Data Structure Fundamentals
WHY ARRAYS MATTER
An array is a fixed-size, ordered collection of elements stored in contiguous memory. Every element is reached by an index, not a search.
Access: arr[i] is O(1), a direct memory offset
Order: elements keep insertion order, indexed from 0
COMMON OPERATIONS
push / pop is O(1), at the end of the array
shift / unshift is O(n), at the start of the array
TIME COMPLEXITY
Search: O(n), since it must check elements one by one in the worst case
Insert / Delete (middle): O(n), since every element after the gap has to shift
ARRAYS VS. LINKED LISTS
Linked lists trade O(1) access for O(1) insertion anywhere, since each node just points to the next and no shifting is required.
Use arrays when: you need fast random access and the size is roughly fixed
Use lists when: you're inserting/removing often and access is mostly sequential
KEY TAKEAWAY
Contiguous memory is what makes arrays fast to read and slow to resize. Every trade-off in this lecture traces back to that one fact.
SCHLR NOTES
YOUR SLIDE
↔