Performance benchmark Bubble vs Quicksort

ordering.py

import random
import time


def quicksort(items):
    lowest = []
    equal = []
    greater = []

    if len(items) > 0:
        pivot = items[0]
        for i in items:
            if pivot > i:
                greater.append(i)
            elif pivot < i:
                lowest.append(i)
            else:
                equal.append(i)
        return quicksort(greater) + equal + quicksort(lowest)
    else:
        return items

def sort_bubble(items):
    result = items[:]
    temp = 0
    for j, k in enumerate(result):
        for x in range(0, len(result) - 1):
            if result[x] > result[x + 1]:
                temp = result[x]
                result[x] = result[x + 1]
                result[x + 1] = temp
    return result


def main():
    random_list = [random.randint(1,100) for i in range(10000)]

    print('corriendo bubble')
    start_time = time.time()
    for i in sort_bubble(random_list):
        pass
    elapsed_time1 = time.time() - start_time

    print('corriendo quicksort')
    start_time = time.time()
    for i in quicksort(random_list):
        pass
    elapsed_time2 = time.time() - start_time

    print('elapsed time bubble: ', elapsed_time1)
    print('elapsed time quicksort: ', elapsed_time2)


if __name__ == '__main__':
    main()