Automata Theory - Complexity, Question
|
|
 Mar 4 2006, 02:23 AM, updated 20y ago
Show posts by this member only | Post
#1
|
 
Junior Member
455 posts Joined: Oct 2005 From: Birmingham, UK  
|
I have a question.. regarding to complexity..
Processor speed doubles roughly every 18 months. This means that bigger data sets can be processed at the same time. How much bigger exactly, for algorithms whose runtime is given by: a) n where n measures the size of input data? |
|
|
|
|
|
Mar 4 2006, 07:10 AM
Show posts by this member only | Post
#2
|
 
VIP
6,008 posts Joined: Jan 2003
|
Hint: Find out the complexity class of (a), then fit it into the rate of increase of processor speed.
|
|
|
Mar 4 2006, 05:28 PM
Show posts by this member only | Post
#3
|
|
Junior Member
455 posts Joined: Oct 2005 From: Birmingham, UK
|
Hey how to find the complexity of class (a)? Do I need to put examples for that?
|
|
|
Mar 4 2006, 09:53 PM
Show posts by this member only | Post
#4
|
|
VIP
6,008 posts Joined: Jan 2003
|
It's given in the question.
|
| Change to: |  0.0132sec
 1.36
 5 queries
 GZIP Disabled
Time is now: 23rd December 2025 - 11:08 PM |
Quote