Pinned Repositories
advent-of-code-2023
DiceRollerAndroidApp
First Android App using Kotlin. Uploaded to github to save/keep for reference later.
DistributedJobScheduler
A Distributed Job Scheduling Algorithm.
DynamicBreakSchedule
HaskelLikeInterpreter
Produces Abstract Syntax Trees for given Haskell-like language.
JavaNoise
Originally started as a project to replicate noise-algorithms such as Perlin Noise. Instead became a project to recreate Conway's Game of Life in Java using SWING and AWT.
mrthygesen16.github.io
Thygesen Dev Personal Blog
pdfDataReader
Python Script for extracting data from numerous pages in a PDF document.
Rust-Set-Cover
The set cover problem is a classical question in combinatorics, computer science, operations research, and complexity theory. It is one of Karp's 21 NP-complete problems shown to be NP-complete in 1972. Given a collection of elements, the set covering problem aims to find the minimum number of sets that incorporate (cover) all of these elements.
TXT2CSV
For the conversion of unformatted text files into CSV files.
MrThygesen16's Repositories
MrThygesen16/pdfDataReader
Python Script for extracting data from numerous pages in a PDF document.
MrThygesen16/advent-of-code-2023
MrThygesen16/DiceRollerAndroidApp
First Android App using Kotlin. Uploaded to github to save/keep for reference later.
MrThygesen16/DistributedJobScheduler
A Distributed Job Scheduling Algorithm.
MrThygesen16/DynamicBreakSchedule
MrThygesen16/HaskelLikeInterpreter
Produces Abstract Syntax Trees for given Haskell-like language.
MrThygesen16/JavaNoise
Originally started as a project to replicate noise-algorithms such as Perlin Noise. Instead became a project to recreate Conway's Game of Life in Java using SWING and AWT.
MrThygesen16/LispInterpreter
A simple interpreter for a LISP-like language.
MrThygesen16/mrthygesen16.github.io
Thygesen Dev Personal Blog
MrThygesen16/Rust-Set-Cover
The set cover problem is a classical question in combinatorics, computer science, operations research, and complexity theory. It is one of Karp's 21 NP-complete problems shown to be NP-complete in 1972. Given a collection of elements, the set covering problem aims to find the minimum number of sets that incorporate (cover) all of these elements.
MrThygesen16/TXT2CSV
For the conversion of unformatted text files into CSV files.
MrThygesen16/godot-of-life
MrThygesen16/MrThygesen16
Config files for my GitHub profile.
MrThygesen16/py_template
Python project template.
MrThygesen16/PythonSiteGen
Repo for my website
MrThygesen16/rilox
Tree-walk interpreter from https://craftinginterpreters.com/ part II
MrThygesen16/rust-binary-search
Simple Binary Search Implemented in Rust
MrThygesen16/rust_guessing_game
Simple guessing game written in Rust.
MrThygesen16/ScissorPaperRockC
Simple C program to play Scissor paper rock, and some other variants of the game.
MrThygesen16/Set-Cover-Problem
MrThygesen16/SPR-Rust
Simple implementation of Rust for learning purposes
MrThygesen16/TicTacToe
Simple Tic-Tac-Toe Game in Java