v0.4.0

v0.4.0 (2020-09-14)

Chore

• bump v0.4.0
• update dep versions

Fix

• AVL Tree rotation height calculation error
• IntervalTree delete fixup bug
• RBT delete nullpoinexcept
• BST successor bug
• coveralls build
• link to artifactory
• MaxHeap: heapshort algorithm

Refactor

• add private constructors, simplify ArrayList

Test

• AVL Tree min, max, removal
• intervaltree successor and delete methods
• RBT successor and delete methods
• BST successor and delete methods
• DoubleLinkedList remove back, front, get head, prev, next
• LinkedList get the head and next
• more cases for IntervalTree
• more cases for MinMaxHeap
• more cases for RBT
• more cases for AVLTree
• add test MinHeap
• add test MaxHeap
• add test Stack

v0.3.0

v0.3.0 (2020-09-05)

Chore

• increase version v0.3.0

Docs

• add install gradle/maven instructions
• changelog example generation
• MinMaxHeap: add pushUp method javadoc
• MinMaxHeap: add basic docs for Double Ended Priority Queue

Feat

• MinMaxHeap: implementation of a Double Ended Queue

Fix

• BinaryHeap: doc example, init without elements bug, first capacity expantion bug

Test

• MinMaxHeap: implementation of a Double Ended Queue

v0.2.0

v0.2.0 (2020-08-22)

Chore

• update to v0.2.0
• update licence year
• fix Google Coding Style
• Gradle: update gradle wrapper

Docs

• add SegmentTree javadoc
• update javadoc for Red Black Tree
• add basic tasks for project
• add LinkedList javadoc
• add Trie docs
• B-Tree: successor, predecessor
• B-Tree: add time complexity docs for search and insert
• Interval Tree: update README
• Javadoc: add IntervalTree example
• Javadoc: add queue example
• Javadoc: add stack example
• Javadoc: wiki for BreathFirstSearch
• Javadoc: wiki for DepthFirstSearch
• Javadoc: wiki for BinarySearch
• Javadoc: wiki for Math
• Javadoc: wiki for SegmentTree
• Javadoc: wiki for Stack
• Javadoc: wiki for LinkedList
• Javadoc: wiki for IntervalTree
• Javadoc: wiki for MerkleTree
• Javadoc: wiki for RedBlackTree
• Javadoc: wiki for BTree
• Javadoc: wiki for ALVTree
• Javadoc: wiki for BinarySearchTree
• Javadoc: wiki for Pair
• Javadoc: wiki for DisjoinSet
• Javadoc: wiki for DoubleLinkedList
• Javadoc: wiki for FibonacciHeap
• Javadoc: wiki for MinHeap
• Javadoc: wiki for MaxHeap
• Javadoc: wiki for Queue
• Javadoc: wiki for Trie
• Javadoc: wiki for Graph
• Javadoc: wiki for Prim
• Javadoc: wiki for Kruskal
• Javadoc: wiki for FloydWarshall
• Javadoc: wiki for Dijkstra
• Javadoc: add MinHeap, MaxHeap, BinaryHeap method description
• Javadoc: wiki for RabinKarp
• Javadoc: wiki for J.Kadane
• Javadoc: wiki for KnuthMorissPratt
• Javadoc: add Trie and Stack documentation
• Javadoc: examples and doc to Utils
• Javadoc: add Pair method description
• Javadoc: add MerkleTree example
• Javadoc: add DoubleLinkedList example
• Javadoc: wiki for BellmanFord
• README: add successor functions to BST and RBT
• Red-Black Tree: add link to RBTree files
• SegmentTree: add time complexity docs

Feaet

• Red-Black Tree: add fixup funtion and rotation tests

Feat

• add Changelog and release badge
• add successor function to Binary search tree data structure
• all permutation for unique elements
• add LCS algorithm
• add binarySearchFirstLowest and binarySearchFirstHighest methods
• get digit at index in a number
• AVLTree: make the type generic
• AVLTree: add insert, delete, search
• B-Tree: add insert method
• B-Tree: add getPredecessor, getSuccessor methods
• B-Tree: add delete methods
• B-Tree: add insert method skeleton
• BInary Search Tree: add preOrderVisit function
• BST: add delete method
• BST: make the type generic
• Binary Search Tree: add inOrder and postOrder visit method
• CountingSort: sort on columns, i.e. on a specified digit index
• FibonacciHeap: add basic docs
• FibonacciHeap: add insert method
• FibonacciHeap: add skeleton for extractMin method
• FibonacciHeap: add delete and extract methods
• Interval Tree: add IntervalTree data structure
• Javadoc: add Quick sort docs
• Javadoc: fix html errors, simplify code, add more docs
• Javadoc: add merge sort docs
• Javadoc: add Disjoint set docs
• Javadoc: add BST example
• Javadoc: add bubble sort docs
• Javadoc: add counting sort docs
• Javadoc: add docs for methods
• Javadoc: add MaximumSubarray docs
• Javadoc: add binary search docs
• Javadoc: add Fibonacci Heap docs
• Javadoc: add B-Tree description
• Javadoc: add documentation for Math algos
• Javadoc: add Graph doc
• Javadoc: add BreadthFirstSearch examples
• Javadoc: add DFS examples
• Javadoc: update data structures docs
• Javadoc: add Dijkstra examples
• Javadoc: add Floyd Warshall examples
• Javadoc: add Kruskal examples
• Javadoc: add insertion sort docs
• Javadoc: add Knuth moris pratt docs
• Javadoc: add Quick sort docs
• Javadoc: add Prim examples
• Javadoc: add RadixSort examples
• Javadoc: add Bellman Ford examples
• Javadoc: add AVL Tree docs example
• Javadoc: resolve warnings in description
• KnuthMorrisPratt: efficient string matching algorithm
• LIS: algo for Longest Increasing Subsequence
• MerkleTree: add full data structure
• RabinKarp: search pattern in string algo
• RadixSort: add radix sort algorithm
• Red-Black Tree: add delete method
• Red-Black Tree: add successor function, fix delete function
• RedBlackTree: add generic type
• SegmentTree: add Min, Max, Sum Segment Tree data structure
• SegmentTree: add new data structure SumSegmentTree
• Trie: refactor and add remove methods
• release: add maven-central badge

Fix

• formating
• Binary Search: middle value overflow calculation
• FibonacciHeap: unasigned parent in cut method
• FibonacciHeap: wrong double linked list insertion
• FibonacciHeap: recursion errors
• FibonacciHeap: extract element without child
• Red-Black Tree: insertion, insertFix, left/right rotation functions
• SegmentTree: update function
• gradle: disable publish to maven tasks on normal build

Test

• Floyd Warshall edge cases
• DFS and BFS algorithms
• permute unique elements
• B-Tree: delete method
• FibonacciHeap: decrease key and delete methods
• Interval Tree: basic IntervalTree data structure methods
• MerkleTree: build, proof functions
• Red-Black Tree: add delete method
• Red-Black Tree: test insertFixup and insertion

v0.1.0

v0.1.0 (2018-12-07)

Algorithm

• Graphs, minimum spanning tree: Kruskal

Chore

• Coverall extension
• add travis ci
• untrack JetBrains files
• add JaCoCo
• add boilerplate

Docs

• add Graph data structure methods
• add links to code files: BFS, DFS
• add links to datastructures
• add links to the code
• Trie
• Binary Search Tree
• Stack
• MaxHeap
• Queue
• Stack
• add data structures and algorithms in README
• add space between logo and badges
• add logo

Feat

• RedBlackTree: leftRotate, rightRotate, insert functions
• Maximum Subarray problem
• isPalindrome
• Permutation algorithm
• DFS, BFS, Prim, Dijkstra, Bellman-Ford, chore
• linting
• basic Trie data structure
• parametric Queue, Stack, LinkedList, DoubleLinkedList
• BinarySearchTree search, contains methods
• basic BinarySerachTree data structure
• Floyd Warshall algorithm
• DoubleLinkedList, Queue Data Structures
• LinkedList, Stack Data Structures
• CountingSort Algorithms
• QuickSort Algorithm
• MinHeap Data Structure
• BinaryHeap and MaxHeap data structure
• BubbleSort algorithms
• add scheleton algorithms
• add scheleton algorithms

Fix

• MinHeap, MaxHeap and Heapsort bugs
• add travic ci icon
• Graph data structure adj list generation
• Floyd-Warshall test
• Bellamn-Ford negative cycle test
• MergeSort merge function

Refactor

• remove unnused variable from Prim algorithm

Test

• Dijkstra algorithm, shortest path
• Prim algorithm for minimal spanning tree
• MinHeap
• DoubleLinkedList
• LinkedList
• Bellman-Ford algorithm
• MaxHeapTest data structure