recursion

Project 3 of CS 32. The AnagramFinder program is designed to search for anagrams within a given dictionary with large amounts of data. By inputting a word, the program fetches all possible anagrams by permuting the string's letters and cross-referencing them with the dictionary. The AnagramFinder has a strong emphasis on using recursion to accomplish all forms of repetition, whether it be string manipulation or file operations. The program adheres to memory efficiency guidelines, running within an 8MB limit on Linux.

My studies on the amazing The Little Schemer book.

A Guile-OpenGL example.

Laboratori di APA PoliTo 2019/2020

Preparations for coding interviews

Poznamky k prednaske o rekurzii: https://matusf.gitlab.io/rekurzia/

Protects recursive functions processing collections from infinite recursion