Implementing different set algorithms in Python for analyzing their performances.
Switch branches/tags
Nothing to show
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Failed to load latest commit information.
.gitignore
README.md
bench.py
bench_print_time.py
benchplot.R
sortedlistset.py
unbalancedtree.py
unsortedlistset.py

README.md

Set Implementation in Python

This project implements different set algorithms in Python, and compares their performances. For more information, please check out my blog post.

Algorithms

Currently, there are 3 set algorithms written: sorted list, unsorted list, and unbalanced tree. The unbalanced tree is written recursively, and it will reach the Python's recursion limit. Refactoring the code is under development.

Visualization

The benchplot.R will generate plots that compare the different set algorithms. Please make sure to set the working directory, and change the file name to open to match yours.