R

recursion

Fatou sets in Julia (Fractals, Newton basins, Mandelbrot)

My lab assignments for IT013IU Data Structures & Algorithms course at HCMIU.

Sierpinski Square

Branch Or Ring Integer System

The code uses backtracking to solve the Constraint Satisfaction Problem (CSP) of map coloring. It checks if assigning colors to regions follows the constraint that no adjacent regions have the same color. The skills involved include algorithm design for backtracking, recursion, and solving CSP problems. The implementation uses Python.

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.

Laboratori di APA PoliTo 2019/2020

Preparations for coding interviews

Protects recursive functions processing collections from infinite recursion