These are small simple implementations of many Data Structures and Algorithms using Go. I'm doing this to refresh my memory of them, and to learn Go better.

You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

Zed A. Shaw 430536da5a A simple naive hashmap implementation.		2 months ago
..
double_list_test.go	First night of doing the data structures.	2 months ago
hashmap_test.go	A simple naive hashmap implementation.	2 months ago
linked_list_test.go	First night of doing the data structures.	2 months ago
ternary_tree_test.go	First night of doing the data structures.	2 months ago