tannerdanger Goto Github PK

30mikes

30mikesout

An Airport Managment Tool

ai_brickbreaker

an implementation of the brick breaker game with an AI element

android-chatapp

The repository for the android portion of the term project

app-landing-page

Get an awesome landing page for your iOS app in less than 30 seconds

auction-app

aws-etl-pipeline

brick_breaker

A simple brick-breaking pong-like game written in Lua

c_programs

A collection of simple C programs created while learning the language

chatapp-webservice

The repository for the web service portion of the term project

doodlejump_clone

easy-street

go-lang-cheat-sheet

An overview of Go syntax and features.

libraryapp

phishapp

pong

powerpaint

A microsoft paint replica built entirely from scratch.

randomimageslideshow

simulation

sorting_algorithm_analysis

The purpose of this study was to compare the run-times of common sorting algorithms on two separate data structures, with 4 different data sizes. This assignment took a little bit of trial and error. The first few times I ran my code I noticed a few runtimes seemed to be much higher than it should have been. I ran through my algorithms line by line and eliminated a few loops and lines of code that caused an extra N to the runtime. Upon adjusting my code, I found my runtimes all were more consistent, and much closer to the average runtime.

tannerdanger.github.io

personal github pages site

tetris

Tetris game built from scratch using lua

tetris_clone

website