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
#
229580
09/02/11
08:07 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: jaytea
i can't really think of a reasonable solution that runs in O(n * log(n)). perhaps something involving an initial sort?
yes, eg sort the array, then for each x in the array use binary search to test for the presence of M-x
O(n * log(n))
Isn't O(n) (what jaytea posted) better than that though?
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