algorithmic-complexity

This is my personal project to explore algorithmic complexity, using time as a proxy and Big O Notation. Documents my explorations of numpy and matplotlib.

Features

Motivation: What are my goals for this project?

I want to learn more about:

Algorithmic complexity
Using time as a proxy
Python
numPy
Matplotlib

Build status

Code style

Screenshots

Tech/framework used

Python
Pytest testing framework

Code Example

Getting started/Installation

git clone https://github.com/kimdiep/algorithmic-complexity.git

Name		Name	Last commit message	Last commit date
Latest commit History 14 Commits
results		results
tests		tests
.DS_Store		.DS_Store
.gitignore		.gitignore
LICENSE		LICENSE
README.md		README.md
find_duplicates.py		find_duplicates.py
generate_results.py		generate_results.py
get_last.py		get_last.py
reverse_method.py		reverse_method.py
reverse_slicing.py		reverse_slicing.py
shuffle.py		shuffle.py
sort.py		sort.py
sort_mixed.py		sort_mixed.py

License

kimdiep/algorithmic-complexity

Folders and files

Latest commit

History

Repository files navigation

algorithmic-complexity

Features

Motivation: What are my goals for this project?

Build status

Code style

Screenshots

Tech/framework used

Code Example

Getting started/Installation

How to use?

Credits

License

About

Resources

License

Stars

Watchers

Forks

Languages