linear-time

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

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

🍢 Radix sorting algorithms for JavaScript

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.

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)

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).