This repository contains a Python implementation of the Heap Sort algorithm. Heap Sort is a comparison-based sorting algorithm that leverages the properties of a max-heap data structure to efficiently ...

I felt it was interesting to compare different implementations of taking the maximum value of an array. Some in Python and some through Rust. Python max(): 0.085s Python for-loop: 0.161s Rust max(): 1 ...

Learn how this popular Python library accelerates math at scale, especially when paired with tools like Cython and Numba.