dynamic_array.py

class DynamicArray:
    def __init__(self, capacity=8):
        self.count = 0
        self.capacity = capacity
        self.storage = [None] * self.capacity

    def insert(self, index, value):
        if self.count == self.capacity:
            # increase size
            print("ERROR:, Array is full")
            return

        if index >= self.count:
            print('Error: Index out of bounds')
            return

        for i in range(self.count, index -1):
            self.storage[i] = self.storage[i-1]

        self.storage[index] = value
        self.count += 1

    def append(self, value):
        if self.count == self.capacity:
            # increase size
            print("ERROR:, Array is full")
            return

        # self.count += 1
        # # account for zero index... - 1
        # self.storage[self.count - 1] = value
        #
        # same as above
        self.storage[self.count] = value
        self.count += 1

        # Double the size
    def double_size(self):
        self.capacity *= 2
        new_storage = [None] * self.capacity

        for i in range(self.count):
            new_storage[i] = self.storage[i]

        # change pointer
        self.storage = new_storage