Question

why we use log2 n otherthan log10 n in computer science algorithums (calculating time complexities

Comments

I think...  We deal with binary data which means either 0  or 1  so for that we use base 2 of log n.. So we prefer to use logbase 2 n to calculate time complexityin algo..

Answer 1

https://en.wikipedia.org/wiki/Binary_logarithm

Answer 2

who said we always deal with log base 2 only in computer science!! most of the topic in gate syllabus are concerned about binary trees so we say that we always use log base 2.have you thought about b-trees and b+ trees there we have the base m concept where m is the order of tree .incase of binary tree m is always 2 so we use base 2 try to evaluate the height of a binary tree when number of nodes are given and the height of a m-ary tree when number of nodes are given you have to use log base 2 and log base m respectively