If these are supposed to be idiomatic in each language, this is more sensible than explicit looping with a counter.
- The Game of Life, ran with pygame! - You can pause with 'p' and click the screen to add a cell whereever you want.
- Regular expressions :)
- Probably the easiest sort to code (if you already have a heap, that is). - Also, did major modifications to the heap versions.
- A heap o' leaves. An important data structure!
- A BST. Know what this is? Can you write one right now?
- A modified Binary Search of my own invention. Check the notes! - Also, added fuse_intlists(IntList *, IntList *) to intlist.c!
- Turns out the Haskell solution didn't work. At all. - Also, fixed a bug in Day01's python solution.
- Haskell version was returning a Bool... don't ask why.
- Made an edit in BS_NOTES.txt
- Fastest search algorithm in the west. Probably. Is a copy of Programming Pearls sitting on your night stand?
- Gotta love quick sort. Check the NOTES!
- Primes numbers! See the PRIMES_NOTES text file for all the info!
- A standard linked list in the three languages! Although, it is a bit silly to bother with them in Python and Haskell...
- Changed intlist a little bit. - FizzBuzz in three languages! There are two Haskell versions.
- Standing for 'int to list', itol is a function I originally wrote for solving Project Euler problems in python. It and I have come a long way, so I decided to showcase it here. Note that the C version is a bit more detailed, and is more of a general 'int list' library.
- Felt I should show how this is done in the three languages. The Python version is of particular note.
- Minor bug fix in the Python version.
-Essentially wc -l. Very simple.
- Essentially wc -l. Very basic.
This algorithm takes a string and prints it out with the order of the words flipped. Appears to be a common interview question.