Is Bubble sort stable?

Given an algorithm taking a list of n strings as input such that each string is limited by a fixed number of characters, with respect to what should its complexity be analysed?

Estimate the complexity of the following function in terms of the input integer n:

def mystery(n: int) -> None:
    result = 0
    for i in range(n):
        for j in range(100000000):
            result += i * j
    return result

Is Selection Sort Incremental?

Given that there are n items in a list to sort, what's the maximum number of swaps for Selection Sort per iteration?

Given an algorithm taking a string as input, with respect to what should its complexity be analysed?

Estimate the complexity of the following function in terms of the input integer n:

def mystery(n: int) -> None:
    result = 0
    for i in range(10000000):
        j = n
        while j > 2:
            result += i
            j /= 2
    return result

Can Bubble Sort be made incremental?

Is Selection Sort Stable?

Given that there are n items in a list to sort, what's the maximum number of swaps for Bubble Sort per iteration?