Python
Big-O Coding Exercise
Need solving and explanation
Pls answer only if u know big-o
Extracted text: Big-O Coding Exercise Show your solution and explanations. Problem 5 def alsotwoloops (n) : for i in range (n): print(n) for i in range (n): print(n) For the following snippets of code perform the following Find the function for the number of steps the algorithm performs. To what Big-O set will this algorithm belong to? In other words what is the complexity of this algorithm? Since n usually refers to input size you may assume it is a positive integer.
Already registered? Login
Not Account? Sign up
Enter your email address to reset your password
Back to Login? Click here