A small correction.
You need to prove if f(n) = O(g(n)).
My Proff (under Note) is for f(n) = Ω(g(n))
On Sat, Jul 31, 2010 at 12:08 AM, sourav souravs...@gmail.com wrote:
f(n) = sqrt(n) [squate root of n]
g(n) = log(^2) [log of (n square)]
For the above pair of functions is f(n) = Ω(g(n))?
A program is just an implementation of an algorithm. You may use any
language to implement an algorithm as a program. To make time and space
complexity analysis independent of language or computing platform, we relate
them with algorithm. This is also useful when you need to compare different
On May 5, 7:59 am, Varun Nagpal varun.nagp...@gmail.com wrote:
Complexity of an algorithms is focussed on two aspects: Time it takes to
execute the algorithm(Time Complexity) and the amount of space in memory it
takes to store the associated data(Space Complexity). Most literature in
sorry for replying after a long hours.
@varun thanx for great tutorialbut still i'm confused in the
complexity concept of algorithm. I do not understand that complexity
is for the algorithms or for programs.
On May 8, 11:20 am, Ralph Boland rpbol...@gmail.com wrote:
On May 5, 7:59 am,
