jdunnink

42-exam

My solutions for the exam problems at Codam.

corewar

C language project at Codam: Corewar virtual machine and bytecode assembler

fdf

Jesse Dunnink / Codam / 42 Network / FDF / Fil de Fer / 3D grid rendering

fillit

Jesse Dunnink / Codam / fillit / find the smallest square for a given amount of tetraminos / C algorithms

ft_printf

Jesse Dunnink / Codam / C project / implement printf

get_next_line

Jesse Dunnink / Codam / get_next_line

jdunnink

jdunnink.github.io

basic online portfolio to feature my projects and experience

Lem-in

Lemin is an advanced algorithmic project at Codam dealing with graph theory and networks. The objective of this project was to write an algorithm that is able to find a combination of paths within a network that would produce maximum network flow for a given number of actors. How can we get the most amount of ants through a maze with the least amount of moves?

libft

Jesse Dunnink / Codam / libft / static function library in C

luno_api_sdk

SDK in Rust for accessing the Luno exchange API.

minigrep

basic implementation of the grep command line application in Rust.

push_swap

Efficient sorting algo finder --> What is the most efficient algorithm that sorts a series of random integers?