x/box-o-sand
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

Archiving a bunch of old stuff

Browse Source
This commit is contained in:
Dan Buch
2015-06-22 13:15:42 -05:00
parent a6ec1d560e
commit bd1abd8734
395 changed files with 1 additions and 76 deletions
Download Patch File Download Diff File Expand all files Collapse all files

19
intro-to-algorithms/README
View File

@@ -1,19 +0,0 @@
_________________________________________
/ Finally reading through the Cormen \
| Leiserson Rivest Stein algorithms book, |
\ mannn. /
-----------------------------------------
\ . .
\ / `. .' "
\ .---. < > < > .---.
\ | \ \ - ~ ~ - / / |
_____ ..-~ ~-..-~
| | \~~~\.' `./~~~/
--------- \__/ \__/
.' O \ / / \ "
(_____, `._.' | } \/~~~/
`----. / } | / \__/
`-. | / | / `. ,~~|
~-.__| /_ - ~ ^| /- _ `..-'
| / | / ~-. `-. _ _ _
|_____| |_____| ~ - . _ _ _ _ _>

57
intro-to-algorithms/ch02.py
View File

@@ -1,57 +0,0 @@
from __future__ import print_function
import os
import random
import timeit
DEBUG = os.environ.get('DEBUG') == '1'
def debug(msg):
if DEBUG:
print(msg)
def insertion_sort(arr):
debug('BEGIN')
for j in range(1, len(arr)):
key = arr[j]
i = j - 1
debug('FOR:\tj={}, key={}, i={}'.format(j, key, i))
while i > -1 and arr[i] > key:
arr[i + 1] = arr[i]
debug('WHILE:\tset: arr[{}] = {}'.format(i + 1, arr[i]))
i = i - 1
arr[i + 1] = key
debug('FOR:\tset: arr[{}] = {}'.format(i + 1, key))
debug('END')
return arr
def main():
for power in range(1, 5):
to_sort = list(range(10 ** power))
to_sort_sorted = to_sort[:]
to_sort_reversed = list(reversed(to_sort[:]))
for i in range(3):
random.shuffle(to_sort)
for arr, desc in (
(to_sort_sorted, 'sorted'),
(to_sort, 'shuffled'),
(to_sort_reversed, 'reversed')):
timing = timeit.timeit(
lambda: insertion_sort(arr),
number=10
)
print('{} {}: {}'.format(10 ** power, desc, timing))
if __name__ == '__main__':
main()