Tagged Questions
4
votes
2answers
239 views
Abuse of big-O notation? (version 2 - simplified and revised)
Given exam question:
Algorithms A & B have complexity functions $f(n)=2 log(n^3)+3n$ and
$g(n)=1+0.1n^2$ respectively.
By classifying each $f$ and $g$ as $\mathcal{O}(F)$ for a suitable
...
1
vote
2answers
227 views
Abuse of big-O notation?
Given exam question:
Algorithms A & B have complexity functions $f(n)=10^6n+3n^2$ and
$g(n)=1-2^{-20}n^3$ respectively.
[edit: It has been pointed out by Andre that the given complexity ...
2
votes
1answer
196 views
Big-O, asymptotical dominance, asymptotical equivalence
Let $f(x)= 5x^3+x.$
A) I'm just learning the Big O notation, and my study materials indicate that since $f(x)$ is $O(x^3),$ $f(x)$ is asymptotically dominated by $x^3.$
B) On the other hand, I know ...
1
vote
3answers
119 views
Maximum order of a sum of functions
I'm being introduced to the Big-O notation via Susanna Epp's Discrete Mathematics with Appplications 3rd edition. The following defintion is stated on page 519:
Let f and g be real-valued functions ...
