Big O Notation A simple explanation 

Algorithm Efficiency + Time Complexity + Space Complexity 

Time complexity describes the amount of computer time it takes to run a function 

So, What is Big O Notation? It allows as to talk about how the runtime of the algorithm grows as the inputs grow. 

Why is important to know this? being aware of the efficiency of an algorithm so programmer can create applications with good performance 

No content

Constant-Time O(1) + regardless of the complexity (number of items), the time (iterations) is constant. + no loops 

Other examples: + Pushing to an array + getting an item at a particular index + adding a child element 

Linear-Time O(N) Worst case time (iterations) grows on par with the number of items. 

Other examples: 

Quadratic-Time O(N^2 ) + The time grows exponentially related to the number of inputs. + Nested loops of the same input 

Logarithmic-Time O(log n) + the most efficient approach when dealing with large collections + Divide-and-conquer strategy + -ideally- find a specific element in a collection of one million elements using less than 20 iterations, if we scale the size of the collection to a billion, we will require only less than 30 iterations. 

Exponential Time O(2^n) + double the number of operations performed relative to the input size. 

Factorial Time O(n!) + the most expensive one. Adding a nested loop for every elements. 

No content

Real World Problem 

Discussion + Sharing pengalaman / seberapa berguna ini di real project lain? + Kapan udh perlu aware tentang ini? + Ada kasus nyata menarik? ada yg pernah? + Kenapa pas di interview-interview ditanya tentang hal ini, padahal kalau di FE hampir gak mungkin ada data ribuan, biasanya di BE