Replaces O(n²) bubble sort algorithm with O(n log n) slices.SortFunc
from the standard library, delivering massive performance improvements.
Performance improvements:
- Large dataset (1000 items): 2,121,531 ns/op → 3,372 ns/op (629x faster!)
- Small dataset (10 items): 199 ns/op → 178 ns/op (10% faster)
- Time reduction: 99.84% for large datasets
Resolves the TODO comment about replacing the simple algorithm.
Also adds comprehensive benchmarks for both small and large datasets
to track performance regressions.
🤖 Generated with [Claude Code](https://claude.com/claude-code)
Co-Authored-By: Claude <noreply@anthropic.com>
* Adding some new funky functions which I find useful
Created a Tuple struct as some of the new functions require you to return a new slice with two fields which is the result of the new functions
Created the Join, JoinProjection, Range, SumMap, Zip functions, ecah fuction is documented with how it works and had a unit test or maybe more
* Added in an OrderBy function
* Documentation comment for OrderBy which I missed out
* Adding a Unit test for JoinProject function
Updated the comments on the Join & OrderBy functions so they make a little more sense.
Covered an extra test case with the Join test, where the left set has more data than the right and so the Right handside array of the join is empty
