CSci 151: Foundations of computer science II
Home Syllabus Assignments Tests

printable version

Review 4: Reasoning about efficiency

Section 4.1: [1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [11]
Section 4.2: [1] [2] [3] [4] [5] [6] [7]
Section 4.4: [1] [2]

Problem 4.1.1.

Write the following Big-O bounds in order, from smallest to largest.

O(n²), O(2n), O((log n)²), O(n sqrt(n)), O(n log n), O(n), O(1)