GitHub - jamalzkhan/RandomAlgorithms

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 5 Commits
BloomFilter.cpp		BloomFilter.cpp
BloomFilter.hpp		BloomFilter.hpp
DataStructure.hpp		DataStructure.hpp
Key.cpp		Key.cpp
Key.hpp		Key.hpp
Makefile		Makefile
RBST.cpp		RBST.cpp
RBST.hpp		RBST.hpp
README		README
SLTest.cpp		SLTest.cpp
SkipList.cpp		SkipList.cpp
SkipList.hpp		SkipList.hpp
analyse		analyse
analyse.cpp		analyse.cpp
counter.dat		counter.dat
dictionary		dictionary
main		main
timer.dat		timer.dat

Repository files navigation

This project contains an implementation of Randomised Data Structures. It is part of coursework done at Imperial College London.

There are three types of structures that we have:
 - Skip Lists
 - Randomised Binary Search Tree
 - Bloom Filter