How to fast calculate ( I mod N)?
Given integer I and an integer N which is power of 2, how does it
Given integer I and an integer N which is power of 2, how does it
1. Donload jdk package from Oracle: wget –header “Cookie: oraclelicense=accept-securebackup-cookie” http://download.oracle.com/otn-pub/java/jdk/8u40-b26/jdk-8u40-linux-x64.tar.gz 2. Setop JDK Environmentsudo