The algorithms are made entirely in objected oriented programming without use of an libraries or external data structures.
Node (in node.py) is a node representation in a single linked list.
LinkedList (in linkedlist.py) is a representation of a Linked List Data Structure.
DNode (in dnode.py) is a node representation in a double linked list.
DoubleLinkedList (in doublelinkedlist.py) is a representation of a Double Linked List Data Structure.
Stack (in stack.py) is a representation of a Stack Data Structure.
Queue (in queue.py) is a representation of a Queue Data Structure.
QIterator (in queue.py) is a representation of an Iterator of the Queue Data Structure.
HashTable (in hashtable.py) is a representation of the HashTable Data Structure using simple Hash Function.
Hash Functions (in hash_functions.py) are simple functions that can be used as hash functions.
Square Root (in sqrt.py) contains differnet ways of calculating square root.
Bubble Sort (in bubble_sort.py) is a simple representation of Bubble Sort.
Selection Sort (in selection_sort.py) is a simple representation of Selection Sort.
composite_directory_example (in designpatterns) is a an example for showing an implentation of System Directory using a Composite Design Pattern.