Domain Name Forum  
Domain Name Coupons

Domain Name Forum

Domain Name Appraisals

VPS FORUM

Expired Domains

Domain Name Tutorials

Parking & Traffic Monetization

Domain Registration Reviews and rating

Domain Name Offers And Requests

Go Back   Domain Name Forum > Web Design & Development > Programming > Computer Science
Reload this Page Assymptotic complexity
Register FAQ Community Calendar Today's Posts Search

 
 
Thread Tools Display Modes
Prev Previous Post   Next Post Next
  #1  
Old 03-12-2011, 01:45 PM
webdev webdev is offline
Senior Member
  
Join Date: Jun 2009
Posts: 7,868
Default Assymptotic complexity
I want to know which os these is bigger 1)f(n)=n^(3/2) 2)f(n)=n log(base2) n Please explain?
__________________
Website Development
Domain Name Forum
Reply With Quote
 

« Previous Thread | Next Thread »

Posting Rules
You may not post new threads
You may not post replies
You may not post attachments
You may not edit your posts
BB code is On
Smilies are On
[IMG] code is On
HTML code is Off
Forum Jump


All times are GMT -4. The time now is 04:03 AM.

| Webmaster Forum | | Domain Name Forum |


Contact Us - Archive - Top

Powered by vBulletin®
Copyright ©2000 - 2026, Jelsoft Enterprises Ltd.