Oris
Today
Universe
Explore
Studio
Authors
Account
Lesson 1 of 7
What is the amortized time complexity of appending to a dynamic array that doubles its capacity when full?
O(1)
O(n)
O(log n)
O(n log n)
Check
Today
Universe
Explore
Profile