Demonstration of implementation of a serial version of quicksort v.s. a parallel version of quicksort in Python 3.

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

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.

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

A performance comparison between different sorting algorithms

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.

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

Project from the CSE 5311 Design and Analysis of Algorithms course at UTA, offering insights into sorting algorithm efficiency and performance.

Data science

Page Replacement Algorithm Simulator is a Streamlit-based application that simulates and compares FIFO, LRU, and Optimal algorithms. It displays memory state changes, compares page faults, and provides insights into algorithm performance.

Path finder for a 2D space using A* Algorithm, and comparison to Dijkstra and BFS

Les Petits Plats is a website containing their own recipes filtered by both search bar and research tag(s). These algorithms are each developed on a separate branch, to compare their performances.