algorithm-comparison

An interactive, educational web application that visualizes core Operating System concepts including CPU scheduling, memory management, and file system operations.

A Logistic model for predicting divorce rates among couples, implemented using the sklearn library.

A comprehensive comparison of 4 algorithms for solving the 0/1 Knapsack Problem: Greedy, Dynamic Programming, Branch & Bound, and Genetic Algorithm. Includes performance analysis, visualization, and dataset generation tools.

Test for comparing sorting algorithms in terms of comparisons, swaps and execution time for the Scientific Methodology subject of Computer Science at Univasf.

An interactive web application for visualizing CPU and Disk scheduling algorithms. This educational tool helps users understand how different scheduling algorithms work through animated visualizations.

Comparative analysis of Brute-force, Horspool's, and Boyer-Moore string matching algorithms.

A benchmarking toolkit for comparing Kruskal's and Prim's minimum spanning tree algorithms across various graph configurations, with visualization tools and performance analysis reports.

🛠 Optimize pallet packing for delivery trucks using various algorithms to enhance efficiency and reduce costs.

A Win-Tie-Loss chart is a visual tool for comparing the performance of different algorithms or methods across multiple tasks or datasets. This type of chart summarizes how often a method "wins," "ties," or "loses" compared to other methods based on a specific performance metric.

A MATLAB app for comparing experimental results with custom metrics, statistical tests, and publication-ready LaTeX tables.

Delivery Truck Pallet Packing Optimization Tool Using Various Programming Approaches, Developed for the L.EIC016 - Algorithm Design Course

A cellular automaton framework for simulating and benchmarking drone swarm cooperation algorithms.

Benchmark and analysis of sorting algorithms based on input size and data variability. Includes reproducible tests, statistical runtime evaluation, and interactive visualizations.

Data science

Desktop simulation in Python and Tkinter comparing Greedy and Round-Robin traffic light scheduling strategies, with live visualization and a performance comparison table.

Titanic survival prediction using ML algorithms with performance comparison and visualization

This project implements and compares four different algorithms for tackling the Two-Echelon Electric Vehicle Routing Problem (2E-EVRP), including the Clarke-Wright savings algorithm and two evolutionary algorithms.

Project to compare list update algorithms in paid-exchanges-only model.

Optimization project comparing Branch and Bound and Genetic Algorithm performance on the 0/1 Knapsack Problem in Python.

A performance comparison between different sorting algorithms