Opening the reading…

How to Calculate Time Complexity from Execution Counts — drill-1 — LearnYard

DSA Sheet

02 Time and Space Complexity / Online JudgeTime and Space ComplexityHow to Calculate Time Complexity?

Lesson · no judge

1 of 4 parts done

1/4

TIME AND SPACE COMPLEXITY / ONLINE JUDGE › TIME AND SPACE COMPLEXITY

Write it, run it, read the output

Reading · 7 minQuiz · 5 questions2 code drills · run only

This is a scratch drill — your code runs, nothing is graded or recorded. No test cases, no expected output, no verdict.

TASK

Complete the C++ program so it processes a = [4, 2, 7, 1] with the sequential loop and the dependent nested loops. Print sum = 14, prefixTotal = 37, the body counts 4 and 10, and their total cost 14.

C++

Loading editor…

OUTPUT

Sample

sum = 14
prefixTotal = 37
sumCount = 4
prefixCount = 10
totalCost = 14

What a finished answer prints, from the lesson. Nothing has run yet — press Run and this is replaced by your program’s own output.

Previous · Comparing different time complexities3 parts left before this item is marked done.Next part · Code drill 2

AI TUTORTalk to tutor

Scoped to How to Calculate Time Complexity?. The tutor can see the reading, its checkpoints and your drill code.

The tutor reads this lesson alongside you and answers questions about it — nudging you towards the answer rather than handing it over.

The tutor will not answer a quiz question for you, and it will not paste a working drill. It explains the reading it can see.