Question: Can someone explain why the following problem has a growth of O(n^2). I'd assume that it's simply O(n) since the for loop just runs n
Can someone explain why the following problem has a growth of O(n^2). I'd assume that it's simply O(n) since the for loop just runs n times.

// arrayList is type ArrayList
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
