Answered step by step
Verified Expert Solution
Question
1 Approved Answer
Give time complexity (Big-O) of this function: def function1(n): sum = 0 for i in range(n): for j in range(i): sum += 1 for k
Give time complexity (Big-O) of this function:
def function1(n): sum = 0 for i in range(n): for j in range(i): sum += 1 for k in range(6000): sum += 1 return sum
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started
Filing And Computer Database Projects
Authors: Jeffrey Stewart
2nd Edition
007822781X, 9780078227813
