If you aren’t familiar with Big O Notation, read the article in the Simple Wiki. Don’t get caught in the details, only try to grasp the concept.
Simple example: If I have a todo list with pen and paper and I want to add a new todo to the end, that’s
O(1). Why? No matter how long the list actually is, adding a new todo to the end always requires the same amount of work.
Today we start with a simple one: Singly Linked List.
O(1)) (every element has an index)
O(N)) (index has to be shifted)
Hi! I'm Michael 👋 I'm a Mentor & Senior Web Developer - I help you to reach your (career) goals.