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 filled with text of n umbers that match their index: "0", "1", "2", "3", "4", int n = arrayList. size(); for(int i-0; i<>