Nawaf Abdullah scriptpapi

🎯

Focusing

code and physics, sometimes physics code, and sometimes code physics.

scriptpapi / quicksort.py

Last active May 23, 2018 17:23 — forked from bcambel/quicksort.py

Simple quick sort implementation

	import random


	def quickSort(iList):
	print("ALL", iList)
	if len(iList) <= 1:
	return iList
	else:
	left = quickSort([x for x in iList[1:] if x<iList[0]])
	middle = [iList[0]]

scriptpapi / trie.py

Last active May 20, 2018 03:51 — forked from zshihang/trie.py

A simple Python Trie data structure implementation

	# A simple Trie implementation


	class Node:
	def __init__(self):
	self.children = dict()
	self.count = 0


	class Trie: