Wikiwaster
No Longer Available
This was an app I built with my friend Will Yee. It was a ton of fun to make and gained some followers because teachers would use it for extra credit - if students completed 5 summaries of random Wikipedia articles, they'd get bonus points on their tests.
This was my first foray into UIDynamics. Check out the history tab when you have at least a page of upvoted articles - the physics-based animations were really satisfying to build.
Features
- Random Wikipedia articles - Discover something new every time
- Summarization - Write summaries to test comprehension
- UIDynamics animations - Physics-based UI interactions
- History tracking - Keep track of articles you've read
Gamer's Forecast
Open Source
This was an app I built for fun that let people see what games were about to be released and set notifications for them. It was a great way to never miss a game launch.
Life got in the way and the time commitment became too much to maintain, but the code is still available on GitHub if anyone wants to take a look or build on it.
Features
- Release calendar - See upcoming game releases
- Push notifications - Get reminded when games launch
- Game database - Browse and discover new titles
View on GitHub
Other Projects
Smaller projects and algorithm implementations from over the years.
C++
Trie
Algorithms
A Boggle solver that uses a Trie structure to efficiently find words. You build a trie from a given dictionary, then search for words in a Boggle grid. It only traverses paths where valid words might exist, making it much faster than a hashtable approach.
The best part was optimizing it for speed. I haven't added threading yet, but that's on the someday list along with caching the built dictionary for reuse.
Python
Google App Engine
Algorithms
A Sudoku solver with a Google App Engine backend. People could input their puzzle online and it would spit out the answer. Written in Python, it was fun to add heuristics to make it run faster - good practice for algorithm implementation.
C
Algorithms
NP-Hard
An old school project implementing the classic traveling salesman problem in C. Finding the shortest route that visits all cities exactly once - one of the most famous problems in computer science.
