Time Complexity - Very Basic - T:N->N

Time Complexity - Very Basic - T:N->N

1. The first N corresponds to the size of the input

   • This means how big the input is, as time complexity is always directly (almost always) to input size. 
   • The second N (result) is the number of steps that the computation will take for an input of that size

2. We count algorithm complexity in basic steps

   • A step/instruction is an operation
     • Takes constant time
     • Not variable
     • Example: A comparison, an array access
     • We use a model known as RAM
       • In which we assume
         • Constant time is required to access memory
         • Access any object in memory, with same amount of time