goadsl's Introduction

goadsl

Go Algorithm and Data Structure Library

ChangeLog:

2014-09-09 initial release
2014-09-13 added singly linked list (Dikaimin)
2014-09-14 fixed InsertLast() and Print() method in singly linked list, added doubly linked list (Dikaimin)
2014-09-16 added queue (Rizal)
2014-09-16 fixed SliceQueue (Dikaimin)
2014-09-22 added singly circular linked list and doubly circular linked list (Dikaimin)
2014-09-22 added SliceDeque (Rizal)
2014-10-02 added LinkBST (Dikaimin)
2014-12-11 added QuickSort, CombSort, Heapsort (Agung)
2014-12-11 added CocktailSort, added Non-recursive MergeSort (Alvreda)
2014-12-13 added Shellsort( versi biasa, Ciura, Knuth) (Marcelinus Devin)
2014-12-14 added Dijkstra (Alvreda)
2014-12-14 added RadixTree (Ahalim)
2014-12-15 added BinarySearch (Siti)
2014-12-15 added SliceHeap (Siti)
2014-12-15 added Skiplist (Cicih)
2014-12-17 added Knapsack 0-1, Knapsack Unbounded (Alvreda)
2014-12-17 added SplayTree (Renhard)

fix LinkedBST so it can store Anything, not just int +500
implement UnrolledSinglyLinkedList, UnrolledDoubleLinkedList +1200 each
implement VList +1600
implement HashFunction +300 each
implement ChainingHashtable +1600 for each type (Linked Bucket, BST Bucket, Array Bucket)
implement ClosedHashtable +1200 for each CollisionFunction
implement ArrayHash +1500 for string value
implement HashArrayTree +1200
implement ArrayBinaryTree, LinkBinaryTree, ArrayBST +1900 each (with BFS printing)
implement AVLTree +2500, RBTree +3400, SplayTree +2000, ArrayAVL, ArrayRB, ArraySplay +4000
implement BSTHeap +600
implement Trie +3600, CompressedTrie +5500, BurstTrie +8000, HATTrie +12500
implement Non-recursive Inplace MergeSort +1800, other sorting algorithms, that allow Less/Equal/Swap/Len interface
implement JumpSearch, InterpolationSearch +400 that Allow Less/Equal interface
implement R-Tree +5000, k-d Tree +8000 (using reflection)
implement any other data structure or algorithm (bounty may vary, contact me for details)

Recommend Projects