Computer Science - Algorithms - Time and space complexity - Analyzing Time and Space

5 steps. Step 1 'Time Complexity': Count primitive operations as function of input size. Loops: multiply. Sequences: add. Conditionals: take worst branch. Recursion: solve recurrence relation. Step 2 'Space Complexity': Count extra memory used (not counting input). Variables: O(1). Array of size n:

Edodovivmagarwal
Computer Science - Algorithms - Time and space complexity - Analyzing Time and Space
Log in

Preparing your experience...

Loading scripts and resources

Comments (0)

0/5000

Comments are reviewed before appearing publicly.

About this Experience

Computer Science - Algorithms - Time and space complexity - Analyzing Time and Space

vivmagarwal
vivmagarwalJan 29, 2026

Description

5 steps. Step 1 'Time Complexity': Count primitive operations as function of input size. Loops: multiply. Sequences: add. Conditionals: take worst branch. Recursion: solve recurrence relation. Step 2 'Space Complexity': Count extra memory used (not counting input). Variables: O(1). Array of size n:

Details

Computer ScienceAlgorithmsClass 11, AS Level, Class 11, Grade 11, DP Year 1

Engagement

11

Likes

0

Remixes

0

Comments

Browse all experiences