Algorithms

Algorithms copied to clipboard

Add finding all complete subgraphs (cliques) in graph

1

Finding all cliques would be great, but the maximal clique is also ok.

williamfiset

Add longest increasing subsequence O(nlogn) implementation.

2

There's a faster way than the DP approach to solve the LIS problem. It can be solved in O(nlogn) time with a binary search, let's add it to the repo.

williamfiset

For `knapsack 0/1`, could figure out which items are included from the resulting 2d array. But, for the `knapsack - unbounded`, I have checked ` KnapsackUnbounded.java`, and then searched on...

kuchaguangjie

Add B-Tree Implementation

7

williamfiset

implement Gauss-Jordan algorithm

2

closes #230

danthe1st

Add Fenwick Tree with range updates and range queries.

1

williamfiset

The Gauss-Jordan algorithm can be used in order to solve linear equations of any size using matrixes. Note that the Gauss-Jordan algorithm is not the same as gaussean elimitation as...

danthe1st

CallMeTushar

I extracted some methods and renamed some variables to increase the understanding, reusability and readability.

ZaqueuCavalcante

The generic segment tree implementation seems to be suffering from two issues when using multiplication range updates with min/max range queries: * The segment tree doesn't seem to handle overflow...

williamfiset