0
Still curious? Ask our experts.
Chat with our AI personalities
Professor
Devin
JordanAdd your answer:
Earn +20 pts
What is the value of log o?
The value of log o is penis
What is complexity of binary search tree?
The complexity of binary search tree : Search , Insertion and Deletion is O(h) . and the Height can be of O(n) ( if the tree is a skew tree). For Balanced Binary Trees , the Order is O(log n).
Log 2 plus log 4 equals log 2x?
log(2) + log(4) = log(2x)log(2 times 4) = log(2x)2 times 4 = 2 times 'x'x = 4
how do i log in?
how do i log in
What is log base 5of 125?
log(5)125 = log(5) 5^(3) = 3log(5) 5 = 3 (1) = 3 Remember for any log base if the coefficient is the same as the base then the answer is '1' Hence log(10)10 = 1 log(a) a = 1 et.seq., You can convert the log base '5' , to log base '10' for ease of the calculator. Log(5)125 = log(10)125/log(10)5 Hence log(5)125 = log(10) 5^(3) / log(10)5 => log(5)125 = 3log(10)5 / log(10)5 Cancel down by 'log(10)5'. Hence log(5)125 = 3 NB one of the factors of 'log' is log(a) a^(n) The index number of 'n' can be moved to be a coefficient of the 'log'. Hence log(a) a^(n) = n*log(a)a Hope that helps!!!!!
