saml

1. Dining philosopher

They want food so they wait. And end up eating each other.

2. Given a random number generator that returns a number between [0,1], how would you build a RNG that accounted for weighting?

WAT?

3. You have two arrays with N integers in them. Merge those arrays using a recursive algorithm so that the integers in the final array are sorted.

bhelx

#!/usr/bin/env python

#
# Converts any integer into a base [BASE] number. I have chosen 62
# as it is meant to represent the integers using all the alphanumeric
# characters, [no special characters] = {0..9}, {A..Z}, {a..z}
#
# I plan on using this to shorten the representation of possibly long ids,
# a la url shortenters
#