# dsa A data-structures and algorithms library for node ## Overview > "A data-structure a day keeps the mind atrophy away..." -- Some wise dude. The primary motivation behind `dsa` is to keep myself sharp. Specifically, its goal is to provide a "low stress" way to keep myself engaged with algorithmic problem-solving. I, due to my limited imagination, could think of no better way to do so than to implement a nice library of common and exotic data-structures and algorithms. The secondary motivation is to provide a useful and large library of structures and algorithms to supplement existing libraries. ## Completed - [BitArray](https://en.wikipedia.org/wiki/Bit_array) ## Proposed Data-Structures ### Arrays - [CircularBuffer](https://en.wikipedia.org/wiki/Circular_buffer) - [GapBuffer](https://en.wikipedia.org/wiki/Gap_buffer) - See also: [Good Math, Bad Math Article](http://scienceblogs.com/goodmath/2009/02/18/gap-buffers-or-why-bother-with-1/) ### Lists - [LinkedList](https://en.wikipedia.org/wiki/Linked_list) - [DoublyLinkedList](https://en.wikipedia.org/wiki/Doubly_linked_list) - [SkipList](https://en.wikipedia.org/wiki/Skip_list) - [UnrolledLinkedList](https://en.wikipedia.org/wiki/Unrolled_linked_list) - [VList](https://en.wikipedia.org/wiki/VList) (functional) - [Zipper](https://en.wikipedia.org/wiki/Zipper_(data_structure)) ## License MIT