Algorithms useful for CS graduates

A library for van Emde Boas tree written in Dlang

A modified van Emde Boas data structure that achieves O(lg w) predecessor and successor queries with O(n) space"

Go implementation of the van Emde Boas tree data structure: Priority queue for positive whole numbers in O(log log u) time.

Cache Oblivious Algorithms

an implementation of the van-Emde-Boas tree data structure, serving as a very efficient priority queue

A library including collection of methods for performing element search in ordered tables

Van Emde Boas Tree implementation using Python.

A .NET Standard library which provides a van Emde Boas tree implementation for educational purposes.