Concurrent implementation of Aho-Corasick string matching algorithm in C.

🍢 Radix sorting algorithms for JavaScript

Understanding and implementation of the algorithm to get three-coloring in triangle-free planar graphs

A linear-time k-center algorithm with fairness conditions and worst-case guarantees that is very fast in practice. Written in Rust with Python bindings.

A rust translation of my easy_dc algorithm and very first rust program.

Presenting potential linear O(M) Diamter finding algorithm with worst case O(m * n). This is simply a C++ implementation of this iFUB algorithm.

find kth Smallest element in list

C++ Implementation of Kruskal's Minimum Spanning Tree algorithm on IP nodes

A linear-time string preprocessing algorithm. Can be used for linear-time pattern matching O(n+m)

Counting Sort O(n) implementation based on CLRS

An Implementation of Ukkonens 1990 linear-time algorithm for finding an approximate shortest superstring in Java. Also includes an extendable version of Aho Corasick's efficient string matcher.

Using Python, created an algorithm inspired by Rabin-Karp Algorithm for string pattern matching in linear time

This procedure initialise an array in logarithmic time, that is O(log n). That is generally asymptotically better than the classic procedure, which takes linear time O(n).

C Wildcard Matching (Linear Time)