All posts

Imagine we have multiple implementation of the same functions How do we know what best? that what bigO is about. You can have more than 10 implementation of the problem. Can we have a numeric repre…

When yu don't need ordering When you need fast access / insertion and removal. Insertion - 0(1) Removal - 0(1) Searching - 0(N) Accessing - 0(1) Object.keys - 0(n) Object.values - 0(N) Object.entri…

In reality complexities are not simple. Logarithm complexities appears more often that we migh want to accept. Logarithm of a number rougly measures the number of times we can divide that number by…

Using BigO notation to define how space used by algorithm changes with input n. We ignore space taken by the inputs Most Primitive (Boolean, Numbers, undefined, null) are constant space. String req…

Big O notation is way of formalizing fuzzy counting. It allows us to talk formally about how the runtime of alorithm grows as the input grows BigO focus on the worst case scenarios n = 1 2 3 4 5

Snippets are scripts that you author in the sources tab. Snippets can be used to alter a webpage, such as to change its content or appearance, or to extract data.

Algorithm: A proces or set of steps to accomplish a certain task. Almost everything that you do in programming involves some kind of Algorithm! It's the foundation of being a succesful problem solv…

What is a Recursion Example of Recursion Tracing a Recursion Stack used in Recursion Time complexity of recursion Recurrence Relation A functions is calling itself. A recursion always have a base c…

Statically declared or Global variable use this memory. Allocated when program starts & remain in existence until it terminates. All function have access to this memory. Static variables (scope is…

Array are index based from 0. linear collection of elements in a continous memory. Element should be of the same type. Get memory location of each type. Add elements in an array. Charcter array alw…