Skip to content

This project includes the use of exhaustive optimization and dynamic programming algorithms to solve the greedy gnome problem.

Notifications You must be signed in to change notification settings

jstran97/CPSC335_GreedyGnomes

Repository files navigation

CPSC335_GreedyGnomes

Course: CPSC 335 - Algorithm Engineering

Description: This project simulates a greedy gnome, whose primary goal is to mine as many gold as it possibly can. The two algorithms, namely exhaustive optimization and dynamic programming, are used to calculate and store the best path regarding the number of gold that the gnome can obtain. Correctness, functionality, and efficiency in terms of time are also measured for each algorithm.

Language(s) used: C++

About

This project includes the use of exhaustive optimization and dynamic programming algorithms to solve the greedy gnome problem.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages