Question

Python3

Modify the original Bubble Sort code shown below so that it will print out the length of the list, total number of comparisons, and total number of swaps needed to sort the list given.

def compare(data, a, b):
    """Returns True if element at index a > element at index b"""
    return data[a] > data[b]

def swap(data, a, b):
    """Swaps the element at index a with element at index b"""
    data[a], data[b] = data[b], data[a]

def bubble_sort( data ):
    """Sorts a list into ascending order"""
    n = len( data )
    for i in range( n - 1, 0, -1 ):
        for j in range( i ) :
            if compare(data, j, j+1) :
                swap(data, j, j+1)

For example:

Test	Result
d = [12, 78, 81, 99, 91] bubble_sort(d)	Length: 5 Comparisons: 10 Swaps: 1
d = [92, 33, 63, 6, 66, 77, 74, 51, 30, 86] bubble_sort(d)	Length: 10 Comparisons: 45 Swaps: 22

Answer 1

def compare(data, a, b):
    """Returns True if element at index a > element at index b"""
    return data[a] > data[b]


def swap(data, a, b):
    """Swaps the element at index a with element at index b"""
    data[a], data[b] = data[b], data[a]


def bubble_sort(data):
    """Sorts a list into ascending order"""
    n = len(data)
    compares, swaps = 0, 0
    for i in range(n - 1, 0, -1):
        for j in range(i):
            if compare(data, j, j + 1):
                swap(data, j, j + 1)
                swaps += 1
            compares += 1
    print("Length: {} Comparisons: {} Swaps: {}".format(len(data), compares, swaps))