initial implementation

Initial implementation of B+ tree.  As of now, only the find works
reliably.
finish insert method

Finished the insert method.  Need to verify that find works.  Doesn't
seem to be working very well now.
implement a binary search for nodes

the bisect module doesn't seem to like arbitrary objects.  Reimplemented
bisect.bisect in pure python  that appears to behave much better.
Added in an empty lab for wrapping C and C++ code.
Description of .o, .so, and .dll files in cwrap lab.
Lab: Statistical Distributions

Review common distributions in statistics.
initial implementation

Initial implementation of B+ tree.  As of now, only the find works
reliably.
finish insert method

Finished the insert method.  Need to verify that find works.  Doesn't
seem to be working very well now.
implement a binary search for nodes

the bisect module doesn't seem to like arbitrary objects.  Reimplemented
bisect.bisect in pure python  that appears to behave much better.
Merge branch 'btree' of github.com:ayr0/numerical_computing into btree
move lab to proper folder

This is an Algorithms lab.
Lab: Balanced Trees

Added balanced trees lab to Vol2
explain AVL balance cases

Use figures to illustrate the balancing cases for an AVL tree.  Added
problem to implement balancing on a BST (from the Data Structures lab).
Merge branch 'master' into cwrap
Merge branch 'develop' into btree

Conflicts:
	Vol2.tex
Merge branch 'master' into cwrap
Merge branch 'master' into cwrap
explain insert for B-Tree

Explained how do node splitting on inserts

Also talked about how balanced trees are structured and why.
remove b-tree implementation

Remove incomplete B-tree code.  Coding a working B-Tree far exceeds the
time requirement of the lab.  We instead have them illustrate find,
insert, and remove on B-Trees.
Merge branch 'master' into cwrap