Recursive-matching

Refactored python implementation to use class-based implementation to follow structure of both rust and c implementations which utilizes structures. Added cleanups to documentation.

Added C implementation of the recursive algorithm. Updated error message for python implementation to assert only 0 or 1 is the accepted axis. Updated documentation based on changes.

What's Changed
* Rust implementation by JohnMVSantos in https://github.com/JohnMVSantos/Recursive-Matching/pull/1

New Contributors
* JohnMVSantos made their first contribution in https://github.com/JohnMVSantos/Recursive-Matching/pull/1

**Full Changelog**: https://github.com/JohnMVSantos/Recursive-Matching/compare/v1.0...v1.0.1

This is an initial release of the Recursive Algorithm. An algorithm designed to formulate unique assignments with the highest (default)
or lowest values found by recursively matching and rematching pairs to
assert the best matching pair.

This algorithm differs from the Hungarian Algorithm which seeks to formulate
assignments based on the minimum (default) or maximum sum of the assignments.

* The assignments formulated with the maximum sum does not always guarantee individual assignments with the highest possible outcome.
* Similarly, the assignments formulated with the minimum sum does not always guarantee individual assignments with the lowest possible outcome.