Integer To Roman

Using randomize partition to avoid the basically ordered sequences

Updated some of the variable names for the ease of understanding the process.

Changed bin_num and bin_copy to binNum and binCopy respectively.

Update BinaryToDecimal.java

Fix binary to octal conversion

Links in the dynamic programming column were not pointing to the right files so I fixed it in the Readme file.

Updated Dynamic Programming Links in Readme.md

Updated Miscellaneous Links in README.md

Added Maths Folder & Absolute Value Program

Lowers the barrier and friction for contributions and learning

Fixes a typo.

See https://github.com/TheAlgorithms/.github

reduce code

code readable

fix memory leak

fix EmptyStackException

Added check if the arrays are null

Update Knapsack.java

optimization

make code more readable

make code less

optimization

add more to Maths

Find max and min value by recursion

init with DEFAULT_CAPACITY

There are no prime numbers smaller than 2 and numbers greater than and divisible by 2 are not prime.

Correct prime check

Now it is simplified without sacrificing accuracy.

The code was very verbose.