MyloTuT/caesar.c
Recreation of the Caesar Cipher.
Developer Profile
MyloTuT
Discovered public repositories for MyloTuT in the GitHub catalog.
MyloTuT/Greedy
Greedy algorithms determine the minimum number of coins to give while making change. These are the steps a human would take to emulate a greedy algorithm to represent 36 cents using only coins with values {1, 5, 10, 20}. The coin of the highest value, less than the remaining change owed, is the local optimum. (Note that in general the change-making problem requires dynamic programming or integer programming to find an optimal solution; However, most currency systems, including the Euro (pictured) and US Dollar, are special cases where the greedy strategy does find an optimum solution.)
MyloTuT/Mario
Mario is a simple program that recreates the half-pyramid using hashes (#) for blocks.