
Computer Science Computer Science Forum 
 LinkBack  Thread Tools  Display Modes 
January 23rd, 2013, 09:52 AM  #1 
Newbie Joined: Jan 2013 Posts: 4 Thanks: 0  complexity of this function
I am trying to figure out complexity of this function (n^21)/(n1) versus (n^2+1)/(n+1) CVan anyone try to explain this one please 
January 23rd, 2013, 11:20 AM  #2 
Global Moderator Joined: Nov 2006 From: UTC 5 Posts: 16,046 Thanks: 937 Math Focus: Number theory, computational mathematics, combinatorics, FOM, symbolic logic, TCS, algorithms  Re: complexity of this function
Both Theta(n).

January 23rd, 2013, 12:20 PM  #3 
Newbie Joined: Jan 2013 Posts: 4 Thanks: 0  Re: complexity of this function
why? what is the big O then 
January 23rd, 2013, 11:32 PM  #4 
Global Moderator Joined: Nov 2006 From: UTC 5 Posts: 16,046 Thanks: 937 Math Focus: Number theory, computational mathematics, combinatorics, FOM, symbolic logic, TCS, algorithms  Re: complexity of this function
If a function is Theta(g(x)) it is both O(g(x)) and Omega(g(x)).


Tags 
complexity, function 
Thread Tools  
Display Modes  

Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
The computational complexity of calculation function  Wilhelm12  Computer Science  1  May 29th, 2013 08:18 AM 
Big O complexity  courteous  Computer Science  0  August 31st, 2010 01:55 AM 
O(sin n), ?(sin n), ?(sin n) complexity  ulita  Computer Science  2  August 18th, 2010 06:56 AM 
complexity problem  baxy7  Applied Math  14  April 20th, 2009 02:29 PM 
complexity theory  complexitytheory  Complex Analysis  1  December 31st, 1969 04:00 PM 