Christopher Hardy

@CrustopherH (3)
CrustopherH (3)
TowerOfHanoi-Iterative
Tower of Hanoi solution for my cs 211 class
CrustopherH (3)
FancyQueens
this project uses pointers and object arrays to print the queen problem.
CrustopherH (3)
StableMarriage
This solves the stable marriage problem using backtracking.
CrustopherH (3)
RatClass
Rational numbers class for cs211
CrustopherH (3)
Queen1-DNoGoTo
This program finds all the solutions to the eight queens problem, without using goto statements;
CrustopherH (3)
nQueens
solves nQueens problem using function pointers
CrustopherH (3)
Perfect Squares
Finds the smallest perfect square ending with two odd numbers.
CrustopherH (3)
StableMarriage-Recursive
Recursive problem for mt cs211 class
CrustopherH (3)
EightNumbers-Recursive
Recursive problem for my cs 211 class
CrustopherH (3)
integration
uses the riman sum to find the area under different curves.
CrustopherH (3)
EightNumbersInACross
this program uses backtracking to solve the eight numbers in a cross problem.
CrustopherH (3)
Queen 1-D
This program solves the queen problem using a 1-d array
CrustopherH (3)
Queen2-D
2-D Queen problem to find how to place queens on a board without attacking each other
CrustopherH (3)
Perfect Squares
This Project finds the first perfect square that end in two digits that are both odd.
CrustopherH (3)
Big Integers
This Project takes two number inputs as strings and returns the sum of the input as strings.