Ad
  • Custom User Avatar

    Simply put, your solution is not O(n). Your two for statement are equivalent to O(n(n - 1)/2). For the first loop of your first for statement, you check n-1 elements. For the second loop of your first for statement, you check n-2 elements. And so on...

    For an algorithm to be O(n), your second for statement must be bounded by a constant, such as for j in range(10000).

  • Default User Avatar
  • Custom User Avatar

    This comment is hidden because it contains spoiler information about the solution