# Benchmarking sorting algorithms in Ruby

For some time now, I wanted to try the implementation of some simple sort algorithms in Ruby. So I did! I’ve implemented 4 sorting algorithms: – Quick sort – Merge sort – Bubble sort – Binary tree sort Quick sort It’s one of the most efficients. In average, it makes O(n.log(n)) comparisons to sort n items. […]