Question

2.What is the order of complexity of the insert function in the worst case? You are required to provide a complexity function, and a proof that your complexity function belongs to a particular complexity class. In your complexity function you may specify the number of comparisons performed, as a function of input size.

def insert(element, sorted):

    if len(sorted) == 0:
        return [element]
    else:
        if sorted[0] >= element:
            new_copy = sorted[:]
            new_copy.insert(0, element)
            return new_copy
        else:
            return [sorted[0]] + insert(element, sorted[1:])

Answer 1

else: ocl 0Cn) complonty- On) i want toms cntl then İ..uo 111.kike 0(η) hin.rs.