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.

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 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.

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.

Gaining a deep understanding of the history and development of reinforcement learning through creating a sophisticated Connect4 agent using techniques built upon over the years discussed by the 'Art of the Problem' youtube channel.

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

A MATLAB-based implementation of fractal image compression enhanced with the Discrete Cosine Transform (DCT), focusing on optimizing compression ratio, PSNR, and memory usage.

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.

This repository provides an efficient JavaScript solution to the **Profit Targets** problem, a common coding challenge that involves finding distinct pairs in an array whose sums equal a given target. This solution leverages hash sets for constant-time lookups, ensuring scalability.

Push Swap 42

Python project implementing Nearest Neighbor and Skyline Query Search algorithms with R-tree data structures for efficient spatial indexing. Part of COMP6210 group project at Macquarie University.

**push_swap** is a C project that implements a sorting algorithm to sort a stack of integers with the minimum number of operations. The goal is to demonstrate efficient stack manipulation and algorithm optimization.

The "Push_swap" project at 42 is a programming challenge focused on sorting integers using a limited set of operations and an auxiliary stack. The goal is to sort the stack with the fewest moves, showcasing efficient algorithm design and problem-solving skills.

DuoHash is an advanced tool for the efficient calculation of forward and reverse hashes of spaced k-mers in nucleotide sequences, improving the analysis of genomic data by reducing processing time and computational resources.

Assignments related to "Algorithm Analysis" course at IPT of NTUU KPI