This started as an in-class project, but I took it a bit further. Using the Google+ API, the program pulls all shared posts from a user's profile, using the original poster to form 'friend' relationships among users based on sharing instead of circles (partially because private data is not avaliable through the G+ API yet).
When I was young, I always wondered who it was who had to sit down and come up with hundreds of mazes to put in a book for children to solve. When I learned that a comptuer was behind all the work, I instantly set out to write my own maze-generating program. I ended up with two results; both generate raw file output and there is currently no way to make them human friendly. Depth-first searching is used to create the mazes. The first program generates a maze of a specified size, displaying the open exits for each cell. The second program was an attempt to break the maze up into chunks; each chunk of the maze is stored in a seperate file. I quickly learned that the file operations cause rediculous slowdowns, so the second maze generator is really only effective for large chunk sizes.
The heightmap generators were done for fun after learning about Brownian motion. The 2D version has been implemented using simple Brownian motion. There is a 3D version that makes use of the diamond-square algorithm, and takes advantage of the Processing.js library to ease the implementation of WebGL.