Name		Name	Last commit message	Last commit date
arrange		arrange
array		array
astar		astar
avl_tree		avl_tree
binary_find		binary_find
binary_tree		binary_tree
bit_operation		bit_operation
bloom_filter		bloom_filter
bplus_tree		bplus_tree
consist_hash		consist_hash
deque		deque
double_linked_list		double_linked_list
dynamic_programming		dynamic_programming
edit_distance		edit_distance
graph		graph
greedy		greedy
hash_code		hash_code
hash_map		hash_map
heap		heap
huffman_tree		huffman_tree
lfu_cache		lfu_cache
links		links
lockfree		lockfree
longint		longint
lru_cache		lru_cache
maths		maths
multi_index		multi_index
permutations		permutations
primer		primer
quik_sort		quik_sort
rate_limiter		rate_limiter
recursive		recursive
ring_buffer		ring_buffer
segment_tree		segment_tree
skip_list		skip_list
sliding_window		sliding_window
stacks		stacks
string		string
tranverse		tranverse
union_find		union_find
vartype		vartype
window		window
.gitignore		.gitignore
README.md		README.md

Repository files navigation

senior project algrithm adventure

*A STAR(A) **
LRU CACHE
LFU CACHE
LOCK FREE(list/ring-buffer)
QUIC SORT
CONSISTENT HASH
FREE LOCK RING BUFFER
BINARY SEARCH
EDIT DISTANCE
BINARY HEAP
FREQUENCE STACK
SKIP LIST
AVL TREE
RATE LIMITER
COUT PRIMER
UNION FIND
GCD LCM
HUFF MAN
SEGMENT TREE
HASH CODE / HASH FUNCTOR
BIG PRIMES
BLOOM FILTER
C++11 ADVANCED FEATURES
B+ TREE
PERMUTATIONS
SLIDING WINDOW

About

Common engineering data structures and algorithms, such as linear,tree,linked list,graph,greedy,divide and conquer,dynamic programming, backtracking, depth search, breadth search and so on

algorithm astar avl-tree bloom-filter bplus-tree edit-distance graphics hashing lfu lock-free lru permutation skip-list union-find

2 stars

1 watching

Report repository

Releases

Packages

Used by

Contributors

Languages