Big O — the idea
concepts

Big O — the idea

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…

Read post

Writing

Recent notes

Data structures, algorithms, and complexity — working notes from the byte_s repo.

Subscribe via RSS
Never miss a post. Plug the feed into your reader of choice.
Copy feed URL
Objects
concepts
Objects
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…
1 min read
Logarithm
concepts
Logarithm
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…
2 min read
Space Complexity
concepts
Space Complexity
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…
1 min read
Big O
concepts
Big O
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
2 min read
Browser dev snippets
concepts
Browser dev snippets
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.
1 min read
Solving new problems
concepts
Solving new problems
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…
3 min read
Recursion Objective
algorithms
Recursion Objective
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…
1 min read
How C programs use memory
concepts
How C programs use memory
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…
6 min read
C++ Array
datastructures
C++ Array
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…
1 min read