Algorithms

Algorithms copied to clipboard

In the current implementation all elements will be placed into bucket 0 (`ar[i] - minValue` is always less than `M`, which is `maxValue - minValue + 1`, so `ar[i] -...

TianyiShi2001

https://github.com/williamfiset/Algorithms/blob/039cfc4efe849228f5af224956fa45d835732efa/src/main/java/com/williamfiset/algorithms/sorting/Heapsort.java#L21-L36 - Since you are checking `n / 2 - 1` is non-negative anyways in line 27, probably it is more elegant to check `n` is more than 1 before...

TianyiShi2001

TianyiShi2001

Several people have contributed algorithms that aren't currently surfaced in the README. Here is a list so that I don't forget: - [ ] https://github.com/williamfiset/Algorithms/pull/119 - [ ] https://github.com/williamfiset/Algorithms/pull/139 -...

williamfiset

Update DoublyLinkedList.java

1

Added condition in addAt() to check when user inputs index greater than size of list

kotkarabhishek

Add Van Emde Boas Tree

2

#75

nishantc1527

Added the code to Matrix Chain Multiplication using DP This code is with respect to the issue [#9](https://github.com/williamfiset/Algorithms/issues/9)

raunakbhupal

add algorithm to find all cliques (complete subgraphs) in a given graph, with tests. Fix #27

iriediese

- `solution2a()`, only create an array half the size of `solution2()`, since all **odd** indices have value 0. - `solution2b()`, only create 3 variables, since to calculate column **n**, only...

kuchaguangjie

add O(n * log n) implementation of the longest increasing subsequence algorithm, with unit tests. Fix #12.

iriediese