studying_python/bubbleSort.py at master · felipemaion/studying_python · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
#!/usr/bin/env python3
# -*- coding:utf-8 -*-
###
# File: /Users/maion/OneDrive/Documentos/Documentos Felipe/programs/ruby/Python/PyCharmProjects/testes/bubbleSort.py
# Project: /Users/maion/OneDrive/Documentos/Documentos Felipe/programs/ruby/Python/PyCharmProjects/testes
# Created Date: Friday, December 20th 2019, 7:46:53 pm
# Author: Felipe Maion
# -----
# Last Modified: Fri Dec 20 2019
# Modified By: Felipe Maion
# -----
# Copyright (c) 2019 MaioneSys
#
#
#
# -----
# HISTORY:
# Date      	By	Comments
# ----------	---	----------------------------------------------------------
###
import timeit

def bubbleSort(nlist):
    for passnum in range(len(nlist)):
        for i in range(passnum):
            if nlist[i][1]>nlist[i+1][1]:
                nlist[i],nlist[1+1] = nlist[i+1],nlist[i]
    return(nlist)


start_time = timeit.default_timer()
nlist = [['a',15], ['g', 25], ['x', 7]]
bubbleSort(nlist)
bubbleSort_time = timeit.default_timer() - start_time

print("WillSort:", bubbleSort_time*1000, "s:", nlist)

start_time = timeit.default_timer()
nlist = [['a',15], ['g', 25], ['x', 7]]
nlist.sort(key= lambda x: x[1])
sort_time = timeit.default_timer() - start_time
print("PythonSort:", sort_time*1000, "s:", nlist)
print("WillSort eh", (bubbleSort_time/sort_time - 1)*100, "% mais lento")