Included are exercises completed while reading Problem Solving with Algorithms and Data Structures by Brad Miller and David Ranum.

• A fraction data type
• A simple logic circuit implementation

• Two different functions to find the smallest value in a list
  • Used to show that even though your function may provide the functionality you're looking for, it's not always the most efficient solution.

• Implementations of data types such as stacks, queues, deuques, unordered lists, and ordered lists.
• A simulation implementing a queue where a computer printer must make its way through it's print jobs over a time period.

• Simple recursive algorithm implementations to:
  • Reverse a string.
  • Return the sum of a list of integers.
  • Convert an integer into it's string representation of any base.
  • Check if a string is a palindrome.
  • Draw a Sierpinski triangle.
  • Solve a Tower of Hanoi puzzle
  • Draw a fractal tree
  • Navigate a maze

• Explored the popular search algorithms including:
  • Binary Search
  • Hash Tables
  • Unordered and Ordered Sequential Search
• Explored sorting algorithms including:
  • Bubble Sort
  • Insertion Sort
  • Merge Sort
  • Shell Sort
  • Quick Sort

I am still in the progress of working through this book and new code will be added daily