Optimal Sparse Decision Trees

This is my undergraduate thesis about high-performance discrete particle swarm optimization (PSO) algorithm and software development of application on JSSP problem.

ALT algorithms on a grid graph used for routing on the sea.

This project presents a C++ implementation for efficiently merging two sorted linked lists into a single sorted list. It focuses on utilizing existing nodes from the original lists and maintaining their order in the merged output.

A short program written in Java calculates the maximum area that can be contained within a set of vertical lines, utilizing a two-pointer algorithm and handling a variety of test cases from simple to complex.

This Java project focuses on implementing a dynamic programming solution to find the shortest combination of numbers that sum up to a given target sum, using recursion and memoization for efficiency.

A Java implementation of an algorithm that determines if a target string can be constructed by concatenating elements from a given word bank, using recursion and memoization for optimization.

Association analysis including support, confidence, and lift between consumer goods

[FRENCH VERSION] The goal of this school project was to conceptualize an algorithm to define one of the most optimal path (for delivery trucks). I mainly used Python and Jupyter Notebook. During this project, I improved my knowledge of advanced complexity. I evolved in a group of 3, which gave us the opportunity to improve our teamwork skills.

A simulated cache system program. Test cache performance by dynamically specifying the cache structure to see how well optimized an algorithm is on different cache structures.

arrays, graphs, hash tables, heaps, linked lists, lists, maps, queues, priority queues, recursion, search trees, sorting, stacks, trees