About

Exam Practice

Master algorithm efficiency analysis, recurrences, combinatorial generation, divide-and-conquer, and midterm exam problems based on Levitin (3rd ed).

Reference text: Introduction to the Design and Analysis of Algorithms, 3rd Edition (Anany Levitin)

Question 1 of 10Score: 0
Asymptotics & Loop Analysis

What is the Big-Theta running time of: for (i = 0; i < n; i++) for (j = i+1; j < n*n; j++) count++;?