algorithm-analysis

Write code that run faster, use less memory and prepare for your Job Interview

Simulate realistic trajectory data seen through sporadic reporting

Source codes for the Data Structures and Algorithms in C++ and Java book

Accenture Pre-Onboard Learning Modules Hands-On

Data Structures and Algorithms final project focused on implementing core data structures, algorithmic solutions, problem-solving techniques, complexity analysis, and practical applications using clean and structured code.

Gebze Technical University - Computer Engineering Assignments

Breadth First Search & Depth First Search graph algorithms

A collection of data structure and algorithms coding problem from interviews including essential data structure llike arrays, dynamic programming, linked lists, graphs, heap, bit manipulation and so on.

Implementation of searching and sorting algorithms, written by me in Java with TDD.

Projects and Essays from Algorithm Implementation (CS 1501) at University of Pittsburgh

A desktop app to benchmark Java code snippets using JMH. Visualizes execution time, throughput, latency, and GC metrics with interactive charts.

Trabalho Final Projeto e Análise de Algoritmos

The Performance Analyzer of Sorting Algorithms is a Java-based tool designed to provide users with comprehensive insights into the efficiency and effectiveness of various sorting algorithms.

Corso di Algoritmi in Java.

Algorithms and Data Structures using Java @ CDAC's PG Diploma in Advanced Computing Course.

Data Structures and Algorithm Analysis, with an emphasis on Java programming.

A high-throughput Java disaster allocation engine using custom pointer-linked Data Structures without built-in Java collections. Features a Max-Priority Queue for severity dynamic scheduling, dynamic supply calculations, an in-memory transactional LIFO undo stack, and an interactive Swing GUI for real-time sandbox allocation monitoring.

Projet d’algorithmie (ALGAV - Master 1 STL, à l'UPMC) : Implémentation et études en Java de tries «Hybrides» et «Arbre de la Briandais» - Note : 19/20

Comparative implementation and empirical analysis of greedy and randomized algorithms for the 0-1 and fractional knapsack problems, benchmarking solution quality against runtime.

A Java and Python project that implements and analyzes Radix Sort for integers and strings using array-based buckets, tracking primitive operations and visualizing performance trends across varying input sizes.