Buckets is a complete, fully tested and documented data structure library written in pure JavaScript.
data-structures collections collection linked-list dictionary map multimap stack queue set bag binary-heap priority-queue binary-search binary-search-tree tree tree-structure buckets data structure linked list heap priority binary data-structure hashmapIf you need to find an item in an array that you know should be near another item, you can use outward-search to do so efficiently. The callback is called on the start index then it works its way outwards to either end of the array.
array search find binary-search algorithmData Structures with Go Language
data-stuctures golang-examples arrays binary-trees linked-list graph-algorithms interview-questions collections stack queue binary-search-tree binary-search tree sorting-algorithms dictionary algorithms educational searching-algorithmsKvstore for time series data, with indexing and data compression. Discussion at Go Forum.
binary-search indexing data-compressionProblems are from: Hackerrank, Leetcode, codility and random problems that I find on Internet. Every end folder (or folder leaf) has the same name of the problem.
hackerrank-solutions hackerrank algorithms data-structures graphs trees trie dfs bfs regular-expressions sorting-algorithms binary-search captcha-solving minimax-algorithm binary-search-treedata structure and algorithm - examples and implementations
dsa data-structures algorithm sorting-algorithms list base-conversion quicksort binary-search linked-listRuby implementation of Algorithms,Data-structures and programming challenges
algorithm maximum-element array-rotation repeated-elements codility stack hackerrank sorted-arrays bubble-sort distinct-elements binary-search merge-sort quicksort insertion-sort selection-sort kadanes-algorithm knuth-shuffling-algorithm pythagorean-triples dutch-nationalflag-problem equilibrium-indexPackage order enables easier ordering and comparison tasks. This package provides functionality to easily define and apply order on values. It works out of the box for most primitive types and their pointer versions, and enable order of any object using three-way comparison with a given func(T, T) int function, or by implementing the generic interface: func (T) Compare(T) int.
search select max sort order compare min partition comparable binary-search pivot condition min-max
We have large collection of open source products. Follow the tags from
Tag Cloud >>
Open source products are scattered around the web. Please provide information
about the open source projects you own / you use.
Add Projects.