Big Oh Notation
An important question is: How efficient is an algorithm or piece of code? Efficiency covers lots of resources, including:
* CPU (time) usage
* memory usage
* disk usage
* network usage
All are important but we will mostly talk about CPU time in 367. Other classes will discuss other resources (e.g., disk usage may be an important topic in a database class).
Be careful to differentiate between:
1. Performance: how much time/memory/disk/... is actually used when a program is run. This depends on the machine, compiler, etc. as well as the code.
2. Complexity: how do the resource requirements of a program or algorithm scale, i.e., what happens as the size of the problem being solved gets larger.
Complexity affects performance but not the other way around.
The time required by a method is proportional to the number of "basic operations" that it performs. Here are some examples of basic operations:
* one arithmetic operation (e.g., +, *).......
View the rest of this paper...
Approximate Word Count: 3738
Approximate Pages: 15 (250 words per double-spaced page)
Why should you join Frat Files?
- - It's safe, secure, and private.
- - Instant access to over 100,000 papers. New papers are added hourly.
- - Fast and reliable customer support.
Similar Essays
-
Big Oh Notation
big oh notation. An important question is: How efficient is an algorithm or
piece of code? Efficiency covers lots of resources, including ... -
Linux Advanced Routing &Amp; Traffic Control
... is sent through a tunnel can only be 1480 bytes big. ... Oh, and of course, the fastest
way to dig a ... the route for network B. Note the different notation for the ...
