This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
def mergesort(c): | |
if len(c) > 1: | |
pivot = len(c)//2 | |
a = c[:pivot] | |
b = c[pivot:] | |
mergesort(a) | |
mergesort(b) | |
ap = 0 | |
bp = 0 | |
cp = 0 |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
def bubblesort(list): | |
swapped = True | |
while swapped: | |
swapped = False | |
for p in range(len(list)-1): | |
if list[p] > list[p+1]: | |
list[p] = list[p] ^ list[p+1] | |
list[p+1] = list[p] ^ list[p+1] | |
list[p] = list[p] ^ list[p+1] | |
swapped = True |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
from random import randrange | |
def qsort(list): | |
if len(list) > 1: | |
pivot = list.pop(randrange(0, len(list))) | |
a = qsort([i for i in list if i < pivot]) | |
b = qsort([i for i in list if i >= pivot]) | |
return a + [pivot] + b | |
else: | |
return list |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
def selectionsort(list): | |
n = [] | |
while len(list) > 1: | |
n.append(list.pop(list.index(min(list)))) | |
return n | |
if __name__ == '__main__': | |
from sys import argv | |
from random import shuffle |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
if __name__ == '__main__': | |
from sys import argv | |
from random import shuffle | |
list = list(range(int(argv[1]))) | |
list.sort() # ;) | |
print(all(list[i] <= list[i+1] for i in range(len(list)-1))) | |
# seriously though timsort is really weird |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
from heapq import heapify, heappop #is this cheating? | |
def heapsort(list): | |
heap = heapify(list) | |
newList = [] | |
while heap: | |
newList.append(heappop(heap)) | |
return newList | |
if __name__ == '__main__': | |
from sys import argv |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
from math import floor | |
def shellsort(list): | |
gaps = gengaps(len(list)) | |
for gap in gaps: | |
for i in range(gap, len(list)): | |
temp = list[i] | |
j = i | |
while j >= gap and list[j-gap] > temp: | |
list[j] = list[j - gap] |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
base = 10 | |
def radixsort(list): | |
maxPlace = max(len(int2base(i, base)) for i in list) | |
list = [(0, i) for i in list] | |
for i in range(1, maxPlace + 1): | |
list = [(FindInPlace(j, base, i), j) for _, j in list] | |
newList = [] | |
for j in range(base): | |
newList += [k for k in list if k[0] == j] |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
fetch(window.location.href).then(res => | |
res.text().then(text => { | |
let domParser = new DOMParser() | |
let newDoc = domParser.parseFromString(text, res.headers.get('Content-Type').split(';')[0]) | |
let newNode = document.importNode(newDoc.documentElement, true) | |
document.replaceChild(newNode, document.documentElement) | |
}) | |
) |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
/* | |
emojify.js 1.0.0 | |
by robbie0630 | |
Description: | |
converts text into Discord-compatible emojis | |
PLANNED FEATURES: | |
* needs more ES2015 | |
* needs more ES2016 |
OlderNewer