Computer Science - Algorithms - Time and space complexity - Complexity Analysis

Determine time AND space complexity. P1: 'def f(n): x=0; for i in range(n): x+=i; return x' → Time: O(___), Space: O(___) [n, 1]. P2: 'def f(n): arr=[0]*n; for i in range(n): arr[i]=i*i; return arr' → Time: O(___), Space: O(___) [n, n]. P3: 'def f(n): if n<=1: return 1; return f(n-1)+f(n-2)' → Time:

Edodovivmagarwal
Computer Science - Algorithms - Time and space complexity - Complexity Analysis
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 - Complexity Analysis

vivmagarwal
vivmagarwalJan 29, 2026

Description

Determine time AND space complexity. P1: 'def f(n): x=0; for i in range(n): x+=i; return x' → Time: O(___), Space: O(___) [n, 1]. P2: 'def f(n): arr=[0]*n; for i in range(n): arr[i]=i*i; return arr' → Time: O(___), Space: O(___) [n, n]. P3: 'def f(n): if n<=1: return 1; return f(n-1)+f(n-2)' → Time:

Details

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

Engagement

8

Likes

0

Remixes

0

Comments

Browse all experiences