mirror of
https://github.com/trekhleb/javascript-algorithms.git
synced 2025-12-08 19:06:00 +00:00
* Get Bit: Make more terse * Power of two: Allowed 1 as a valid power of 2. Power of two: Removed unnecessary exception throwing. * Fisher Yates: Made more terse * Least Common Multiple: Fill undefined value * Greatest Common Divisor: Fill undefined value. Greatest Common Divisor: Make more terse.
9 lines
193 B
JavaScript
9 lines
193 B
JavaScript
/**
|
|
* @param {number} number
|
|
* @param {number} bitPosition - zero based.
|
|
* @return {number}
|
|
*/
|
|
export default function getBit(number, bitPosition) {
|
|
return (number >> bitPosition) & 1;
|
|
}
|