Using Faster Exponential Approximation
In some scenarios/applicatons, where the precision may not be so critically important but the speed (performance) is, you may be willing to sacrifice some extent of accuracy for the …
Using Faster Integer Power in Java
In Java Math Package, there is a pow function with returns double type. However, we can speed up this if only integer (long type) parameters are required, i.e. compute integer power …
Using a Faster Approach to Judge if a Integer is power of Two
Given a signed-integer, we can use the following straightforward method to judge it is the power of two inline bool check1(int i) { if (i < 1) return false; …
A Faster Approach to Count Set Bits in a 32-bit Integer
A bit is set if it is ‘1’. To count how many ‘set’ bits in a 32-bit integer (signed or unsigned), we can use the following straightforward method: inline …
Using Faster Psudo-Random Generator: XorShift
Computers cannot generate (or very difficult) true random numbers. In practise, psudo-random generators are used. To avoid ‘patterns’ for generated ‘random’ numbers, a seed is often used to re-arrange …
Accessing Multi-Dimensional Array in Row-Column Sequence (C/C++)
Usage of Multi-Dimensional Array is popular. For example, a 2-dimension array can be created to represent a chess board state. If we want to clear the state of the …
