Home
About
Download
Register
News
Help
Register
Log In
Forums
General Discussion
algorithmic time complexity
Forums
Active Threads
Search
Who's Online
Help
Print Thread
Re: algorithmic time complexity
Sat
#
229583
09/02/11
09:01 PM
Joined:
Oct 2005
Posts: 827
P
pouncer
OP
Hoopy frood
OP
pouncer
Hoopy frood
P
Joined:
Oct 2005
Posts: 827
Originally Posted By: Sat
Originally Posted By: pouncer
Isn't O(n) (what jaytea posted) better than that though?
It is indeed, as long as you can afford the space and your set of numbers consists of integers only (the O(nlogn) solution works with real numbers as well).
yup, good point! Thanks alot guys.
Copy Link to Clipboard
Entire Thread
Subject
Posted By
Posted
algorithmic time complexity
pouncer
09/02/11
02:05 PM
Re: algorithmic time complexity
jaytea
09/02/11
03:51 PM
Re: algorithmic time complexity
Sat
09/02/11
07:09 PM
Re: algorithmic time complexity
pouncer
09/02/11
08:07 PM
Re: algorithmic time complexity
Sat
09/02/11
08:30 PM
Re: algorithmic time complexity
pouncer
09/02/11
09:01 PM
Hop To
News and Discussions ------
Latest News
General Discussion
Support ------
mIRC Help
Connection Issues
Scripts & Popups
Development ------
Feature Suggestions
Developers
Bug Reports
Print Thread
Switch to Flat Mode
Show Likes
Link Copied to Clipboard
View Profile
Private Message
Follow User
Forum Posts
Forum Rules
·
Mark All Read
Contact Us
·
Help
·
mIRC Homepage