Can you double check my answers?

a) Best-case time complexity is when list is from smallest to largest (ascending), O(n) --> because both inner loops execute only once.

b) Worst-case time complexity is when list is from largest to smallest(descending), O(n^2)

def some_sort (numbers): for j in range(1, len(numbers)): i = i while(i > 0 and numbers [j]