title: base of logarithms in time-complexity algorithms
body: <p>What is the base of logarithm on all time-complexity algorithms? Is it base 10 or base e?</p>
  
  <p>When we say that the average sorting complexity is O(n log n). Is the base of log n 10 or e?</p>