Adding the linked list sample in C. Adding .gitignore files.
Adding the sieve of erathosthenes for Python.
Adding sieve of eratosthenes for Haskell.
Adding generation of combinations in Python.
taking out try-except in sieve.py
Longest common subsequence in Python using the difflib library.
Adding: 1. a binary tree implementation in python. 2. A script to generate a list of unique random numbers in python. 3. A small test script to test float weirdness in C. NOTE: genrandomlist.py and float.c are very hackish. There doesn't seem to be a need to make it more robust.
Updates to bintree.py. Adding preliminary version of dfs.py.
Updates to bintree.py
A reverse the words python program.
Add a non-recursive version of reverse.
Adding first good version of dfs.py
Adding an iterative version of DFS. Question: How do i implement it so that it visits the vertices in the same order as the recursive? (Or vice versa)
Add a version of dfs_iter2, that prints out the nodes in the same order as the recursive version.
Merging from github.