Preview 2 out of 8 pages
Exam (elaborations)
CS 101 Exam 1questions and answers Graded A+
Preview 2 out of 8 pages
CS 101 Exam 1questions and answers Graded A+ Choose the correct increasing ordering of growth rates (for large n). - O(1) O(lg n) O(n) O(n lg n) O(n^2) O(n!) O(n^n) Time complexity: for (a=1; an/4; a++) for (b=1; bn; b+=2) z++; - O(n^2) Time complexity: for (a=1; an; a++) if (a25) for (b=1; bn; b++) z++; - O(n) Time complexity: for (a=1; an; a*=2) for (b=a; b; b++) z++; - O(lg n) Time complexity: for (a=1; a=n; a*=s
Document information
- Uploaded on
- April 8, 2026
- Number of pages
- 8
- Written in
- 2025/2026
- Type
- Exam (elaborations)
- Contains
- Questions & answers
$13.99
Wrong document? Swap it for free
Within 14 days of purchase and before downloading, you can choose a different document. You can simply spend the amount again.
Written by students who passed
Immediately available after payment
Read online or as PDF
Reputation scores are based on the amount of documents a seller has sold for a fee and the reviews they have received for those documents. There are three levels: Bronze, Silver and Gold. The better the reputation, the more your can rely on the quality of the sellers work.
