nickalgo

Install with python -m pip install nickalgo.

import nickalgo as np

dp = np.quicksort
print(dp)  # formatted source code string

sort = np.get_function("quicksort")
print(sort([5, 2, 8, 1]))
print(np.list_algorithms())

Algorithm source strings include sorting, matrix multiplication, selection/randomized algorithms, binary trees and BSTs, graph traversal/MSTs, pattern matching, dynamic programming, Huffman coding, activity selection, set cover, subset sum, and vertex cover.

Notes: radixsort accepts non-negative integers. Strassen multiplication expects equal square matrices whose dimension is a power of two. set_cover and vertex_cover are greedy approximations, not guaranteed optimal. montecarloproblem estimates pi from sample counts. Some names are normalized to Python identifiers such as kth_largest.