Question

1. When does the insert() function of a Dynamic List have a big O

runtime of O(1)?

a. When you are inserting to the end of the list.

b. When the size of the data is small.

c. When you are inserting to the

Answer 1

insert is always O(n) on average, and that the big-O notation don't make specific addressing of edge cases (such as the best or worst case scenario; in your case, an operational that can be reduced to a simple list.

Step-by-step explanation:

your welcome im always here to help (not really some times i joke around but im a child and im still childish) (13 years)