Why is the time complexity O(n^3) shouldn't it be O(n^2)?

[Zainab_Al-Haidary]

Can someone please help me understand why is the time complexity O(n^3) shouldn’t it be O(n^2)? Why creating subarrays takes O(n^2)?

[bharath1]

Because we are adding element at 0 index in templist which is array. So making place at first will need O(n) time.

    tempList.add(0, arr[i]);

[Chang_Tzu_Fan]

But here tempList is LinkedList.
Shouldn’t it be O(1) to add item to first place in LinkedList?

[Garima_Jain]

With LinkedList the tc does seem to be N^2, please correct if not so.

[Vinayak1]

@admin with LinkedList the time complexity does seem to be O(n^2).
Please add this point to the solution.

[Jes_Lou]

have the same question. Thanks for raising it!