
Applied Math Applied Math Forum 
 LinkBack  Thread Tools  Display Modes 
July 31st, 2013, 11:57 AM  #1 
Senior Member Joined: Jul 2012 Posts: 225 Thanks: 0  Analysis of algorithms, please help
Hi, I have a question regarding run time of computer algorithms. we are given 2 functions: and We are required to determine if 
August 28th, 2013, 04:41 AM  #2 
Newbie Joined: Aug 2013 From: United Kingdom Posts: 23 Thanks: 0  Re: Analysis of algorithms, please help
This problem is simpler than you think  all you have to do is look at the exponents of the functions. The exponent of is , While the exponent of is . When you start comparing functions like this, the base quickly becomes irrelevant, and only the exponents matter. So because quickly becomes far greater than , we know that beyond a certain value of , is far greater than, we can say that: So the answer to your questions is 

Tags 
algorithms, analysis 
Thread Tools  
Display Modes  

Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Algorithms (any help?)  iKnowAll  Computer Science  1  February 7th, 2014 01:16 PM 
Mod Algorithms.  vamsi  Number Theory  0  February 25th, 2013 10:35 PM 
Data structure and Algorithms  Christ1m  Computer Science  2  March 23rd, 2011 04:36 PM 
Divisor Counting Algorithms  kenzi_x  Number Theory  5  August 26th, 2009 07:17 PM 
Collision Detection Algorithms  Infinity  Computer Science  4  September 6th, 2007 01:34 PM 