Question
Time complexity of $f(x)=4 x^{2}-5 x+3$ is(A) $O(x)$(B) $O\left(x^{2}\right)$(B) $O\left(x^{3 / 2}\right)$(D) $O\left(x^{0.5}\right)$
Step 1
This is a quadratic function where the highest degree of x is 2. Show more…
Show all steps
Your feedback will help us improve your experience
Aman Gupta and 61 other AP CS educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
Time complexity of $f(x)=\left(x^{2}+5 \log _{2} x\right) /(2 x+1)$ is (A) $O(x)$ (B) $O\left(x^{2}\right)$ (C) $O\left(x^{3 / 2}\right)$ (D) $O\left(x^{0.5}\right)$
Programming and Data Structures
Asymptotic Analysis
Time complexity of $T(n)=2 T\left(\frac{n}{4}\right)+\sqrt{3}$ is (A) $\theta(\sqrt{n} \log n)$ (B) $\theta(\sqrt{n} \log \sqrt{n})$ (C) $\theta(\sqrt{n})$ (D) $\theta\left(n^{2}\right)$
What is the time complexity of the given code? Void $\mathrm{f}$ (int $\mathrm{n})$ \{ if $(n>0)$ E $(n / 2)$; \} (A) $\theta(\log n)$ (B) $\theta(n \log n)$ (C) $\theta\left(n^{2}\right)$ (D) $\theta(n)$
Sorting Algorithms
Transcript
Watch the video solution with this free unlock.
EMAIL
PASSWORD