What is the big O notation of log(n) * log(1-n)
Favorites|Homepage
Subscriptions | sitemap
HOME > > What is the big O notation of log(n) * log(1-n)

What is the big O notation of log(n) * log(1-n)

[From: ] [author: ] [Date: 11-12-21] [Hit: ]
Mathematically, I dont think your question makes sense.I think youd need some formula or algorithm for calculating log(n)*log(1-n), such as involving powers of x, and then you can say the error is O(x^k), or on the order of x^k.......
I am trying to find out the Big O notation of log(n)*log(1-n), I guest it will be log(n)^2 ?

-
See http://en.wikipedia.org/wiki/Big_O_notat… for a description of Big O Notation.

Mathematically, I don't think your question makes sense. I think you'd need some formula or algorithm for calculating log(n)*log(1-n), such as involving powers of x, and then you can say the error is O(x^k), or on the order of x^k. By itself, log(n)*log(1-n) is just an expression, and I don't think O applies.

In computer science, it has something to do with speed of calculation.

BWDIK.

-
log(n)

log(n)^2 = 2log(n), which is the same as log(n) for big O

-
What is the big O?
1
keywords: log,the,What,of,notation,is,big,What is the big O notation of log(n) * log(1-n)
New
Hot
© 2008-2010 http://www.science-mathematics.com . Program by zplan cms. Theme by wukong .