in the best case scenario, where the list was already sorted before running the algorithm, the algorithm's complexity is o(n) (big o notation). in the worst case, where the list starts off as being sorted in reverse, o(n²).