Skip to content

Instantly share code, notes, and snippets.

@joaofeitoza13
joaofeitoza13 / mergeSort.py
Created July 19, 2017 18:13
Mergesort python code.
import random
import timeit
import matplotlib.pyplot as plt
timeBubble = []
timeSelection = []
timeInsertion = []
timeQuick = []
timeMerge = []
elementos = [1000, 5000, 9000, 13000, 17000, 21000, 25000]
@joaofeitoza13
joaofeitoza13 / shellSort.py
Created July 19, 2017 18:26
Shellsort python code.
import random
import timeit
import matplotlib.pyplot as plt
timeBubble = []
timeSelection = []
timeInsertion = []
timeQuick = []
timeMerge = []
timeShell = []
@joaofeitoza13
joaofeitoza13 / countingSort.py
Created July 19, 2017 18:48
Counting Sort python code.
import random
import timeit
import matplotlib.pyplot as plt
timeBubble = []
timeSelection = []
timeInsertion = []
timeQuick = []
timeMerge = []
timeShell = []
@joaofeitoza13
joaofeitoza13 / radixSort.py
Created July 19, 2017 19:21
Radix Sort python code.
import random
import timeit
import matplotlib.pyplot as plt
timeBubble = []
timeSelection = []
timeInsertion = []
timeQuick = []
timeMerge = []
timeShell = []
@joaofeitoza13
joaofeitoza13 / bucketSort.py
Created July 19, 2017 20:38
Bucket Sort python code.
import random
import math
import timeit
import matplotlib.pyplot as plt
timeBubble = []
timeSelection = []
timeInsertion = []
timeQuick = []
timeMerge = []
import random
from timeit import timeit
import matplotlib.pyplot as plt
idade = 24
temposMedios = []
temposOtimos = []
temposPiores = []
tamanhos = [100, 300, 600, 900, 1200, 1500, 1800, 2100]
import random
from timeit import timeit
import matplotlib.pyplot as plt
idade = 24
temposMedios = []
temposOtimos = []
temposPiores = []
tamanhos = [100, 300, 600, 900, 1200, 1500, 1800, 2100]
import random
from timeit import timeit
import matplotlib.pyplot as plt
idade = 24
temposMedios = []
temposOtimos = []
temposPiores = []
tamanhos = [100, 300, 600, 900, 1200, 1500, 1800, 2100]
@joaofeitoza13
joaofeitoza13 / trie.py
Created December 15, 2017 22:41
Algoritmo básico em python para análise da estrutura de dados Árvore Trie
class Node:
def __init__(self, key=None, data=None):
self.key = key
self.data = data
self.children = dict()
def addChild(self, key, data=None):
if not isinstance(key, Node):
self.children[key] = Node(key, data)
else:
import matplotlib.pyplot as plt
from random import randint
from timeit import timeit
def random_array(lenght):
a = []
while(len(a) < lenght):
x = randint(1, 10*lenght)
if x not in a:
a.append(x)