This repo holds sample code for some classic data structures.

It's a joint project of Hannah Krager and A.J. Wohlfert.

Insertion sort algorithm has been included in the src directory and demonstrates best and worst case scenario performance time.

======= The merge sort algorithm has been included in the src directory and demonstrates best and worst case scenario performance time. The merge sort algorithm recursively splits the list into smaller lists, sorts and then merges the two lists. Radix sort algorithm has been included in the src directory and demonstrates best and worst case scenario performance time.

=======

An implementation of a Trie can be found in the src directory. This Trie has the insert and contains methods and only accepts strings as input. The Trie's traverse method is a generator that returns all of the words in the Trie. It also contains an autocomplete method which returns a list of suggested words in the Trie based on a given input as if it were typed 1 character at a time.

Sources:

Our graph traversal functions adapt the algorithms found at: http://code.activestate.com/recipes/576723-dfs-and-bfs-graph-traversal/