title: Big O - O(log(n)) code example
body: <p>Like the Big O notation "O(1)" can describe following code: </p>
  
  <pre><code>O(1):
  
      for (int i = 0; i &lt; 10; i++) {
          // do stuff 
          a[i] = INT;
      }
  
  O(n):
  
      for (int i = 0; i &lt; n; i++) {
          // do stuff 
          a[i] = INT;
      }
  
  O(n^2):
      for (int i = 0; i &lt; n; i++) {
          for (int j = 0; j &lt; n; j++) {
              // do stuff
              a[i][j] = INT;
          }
      }
  </code></pre>
  
  <ul>
  <li>What code can O(log(n)) describe?</li>
  </ul>
  
  <p>Another question:</p>
  
  <ul>
  <li>What solutions are there for "Big O problems" (what to do, when getting a lot of data as an input)?</li>
  </ul>