I am confused about how to write the recurrence equation and solving it without using master theorem to show the average case and worst case time complexity of the question.
I tried to write the equation but I don’t think its true. Also, im not sure that is it the same method for proving big O and big theta notation.
