CS and Interview notes

This will be for CS information and notes to be reviewed for interviews.

Big O

it is a measure of the complexity of an algorithm. It is the worst case scenario for an algorithm.

Call Stack

It is an area of memory devoted to holding information about currently running functions.