Zachary Patterson's repositories

automate-the-boring-stuff

My solutions to all of the projects in Automate the Boring Stuff With Python by Al Sweigart

Language:PythonLicense:UnlicenseStargazers:17Issues:3Issues:1

weather-forecast

A Python script that displays the 5-day weather forecast for a given location at 3 hour intervals. Locations can be searched by city name, postal code, or coordinates. This was implemented using the pyOWM API (Open Weather Map).

Language:PythonLicense:UnlicenseStargazers:4Issues:2Issues:0

clean-desktop

Automated desktop cleaner

Language:PythonLicense:UnlicenseStargazers:3Issues:3Issues:1

network-simulation

This project allows an organ donation system to be simulated within a network of hospitals. The graph itself is represented by a collection of dictionaries. Furthermore, the graph can be interacted with and manipulated.

Language:PythonLicense:MITStargazers:1Issues:5Issues:0

shell-profile

Personal (sanitized) shell profile configuration

Language:ShellStargazers:1Issues:2Issues:0
Language:JavaStargazers:0Issues:2Issues:0

base-conversion

This program gathers input from the console as a string, then determines the base of the input. It then converts binary/octal/decimal/hexadecimal values to binary bytes for storage. It can then convert to any of the other base types as required.

Language:JavaLicense:UnlicenseStargazers:0Issues:0Issues:0

earworms

This program is designed to send catchy lyrics in an attempt to get songs stuck in the recipient's head

Language:PythonStargazers:0Issues:1Issues:0

java-exercises

My solutions to select programming exercises from the Introduction to Java Programming and Data Structures textbook.

Language:JavaStargazers:0Issues:2Issues:0

maze-runner

Simple Prolog program that finds a path through a maze (shortest path problem). This gives the shortest path, then continues to output alternative paths with incrementally increasing weight.

Language:PrologLicense:UnlicenseStargazers:0Issues:2Issues:0

quadratic-vs-logarithmic-time

A comparison between O(n²) and O(n logn) sorting algorithms. The algorithms chosen are insertion sort and merge sort respectively.

Language:PythonLicense:UnlicenseStargazers:0Issues:2Issues:0

stack-vs-queue

A brief comparison in performance between stacks and queues

Language:JavaLicense:UnlicenseStargazers:0Issues:0Issues:0
Language:PHPStargazers:0Issues:2Issues:0