孙佰贵的专栏

reference: http://www.geeksforgeeks.org/efficient-way-to-multiply-with-7/Problem Definition:Figure out a way to multiply with 7 efficiently.Solution:We can multiply a number by

reference: http://www.geeksforgeeks.org/smallest-of-three-integers-without-comparison-operators/Problem Definition:Write a C program to find the smallest of three integers, without usi

reference: http://www.geeksforgeeks.org/next-higher-number-with-same-number-of-set-bits/Problem Definition:Given a number x, find next number with same number of 1 bits in it’s binary

reference: http://www.geeksforgeeks.org/add-1-to-a-given-number/Problem Definition:Write a program to add one to a given number. You are not allowed to use operators like ‘+’, ‘-’, ‘*’

reference: http://www.geeksforgeeks.org/multiply-an-integer-with-3-5/Problem Definition:Given a integer x, write a function that multiplies x with 3.5 and returns the integer result. Y

reference: http://www.geeksforgeeks.org/turn-off-the-rightmost-set-bit/Problem Definition:Write a C function that unsets the rightmost set bit of an integer.Solution:Let the in

reference: http://www.geeksforgeeks.org/count-total-set-bits-in-all-numbers-from-1-to-n/Problem Definition:Given a positive integer n, count the total number of set bits in binary repr

reference: http://www.geeksforgeeks.org/a-boolean-array-puzzle/Problem Definition:Input: A array arr[] of two elements having value 0 and 1Output: Make both elements 0.Specific

reference: http://www.geeksforgeeks.org/count-number-of-bits-to-be-flipped-to-convert-a-to-b/Problem Definition:You are given two numbers A and B. Write a program to count number of bits

reference: http://www.geeksforgeeks.org/write-an-efficient-method-to-check-if-a-number-is-multiple-of-3/Problem Definition:The very first solution that comes to our mind is the one tha

reference: http://www.geeksforgeeks.org/write-a-c-program-to-find-the-parity-of-an-unsigned-integer/Problem Definition:Parity: Parity of a number refers to whether it contains an odd or

reference: http://www.geeksforgeeks.org/binary-representation-of-a-given-number/Problem Definition:Write a program to print Binary representation of a given number.Solution:Thi

reference: http://www.geeksforgeeks.org/swap-all-odd-and-even-bits/Problem Definition:Given an unsigned integer, swap all odd bits with even bits. For example, if the given number is 23 (000

reference: http://www.geeksforgeeks.org/add-two-numbers-without-using-arithmetic-operators/Problem Definition:Write a function Add() that returns sum of two integers. The function should

reference: http://www.geeksforgeeks.org/swap-bits-in-a-given-number/Problem Definition:Given a number x and two positions (from right side) in binary representation of x, write a functio

reference: http://www.geeksforgeeks.org/find-the-element-that-appears-once/Problem Definition:Given an array where every element occurs three times, except one element which occurs onl

reference: http://www.geeksforgeeks.org/position-of-rightmost-set-bit/Problem Definition:Write a one line C function to return position of first 1 from right to left, in binary representat

reference: http://www.geeksforgeeks.org/compute-modulus-division-by-a-power-of-2-number/Problem Definition:Compute n modulo d without division(/) and modulo(%) operators, where d is a

reference: http://www.geeksforgeeks.org/rotate-bits-of-an-integer/Problem Definition:Bit Rotation: A rotation (or circular shift) is an operation similar to shift except that the bits

reference: http://www.geeksforgeeks.org/find-two-non-repeating-elements-in-an-array-of-repeating-elements/Problem Definition:Given an array in which all numbers except two are repeated o

reference: http://www.geeksforgeeks.org/next-power-of-2/Problem Definition:Write a function that, for a given no n, finds a number p which is greater than or equal to n and is a power of

reference: http://www.geeksforgeeks.org/find-whether-a-given-number-is-a-power-of-4-or-not/Problem Definition:Find whether a given number is a power of 4 or not.Solution:

reference: http://www.geeksforgeeks.org/find-the-number-occurring-odd-number-of-times/Problem Definition:Given an array of positive integers. All numbers occur even number of times excep

reference: http://www.geeksforgeeks.org/check-for-integer-overflow/Problem Definition:Write a “C” function, int addOvf(int* result, int a, int b) If there is no overflow, the function pl

reference: http://www.geeksforgeeks.org/write-an-efficient-c-program-to-reverse-bits-of-a-number/Problem Definition:Write an Efficient C Program to Reverse Bits of a NumberSolu

reference: http://www.geeksforgeeks.org/write-one-line-c-function-to-find-whether-a-no-is-power-of-two/Problem Definition:Write one line C function to find whether a no is power of two.

reference: http://www.geeksforgeeks.org/compute-the-minimum-or-maximum-max-of-two-integers-without-branching/Problem Definition:The key idea is to incorporate the branch into one equation.

reference: http://www.geeksforgeeks.org/count-set-bits-in-an-integer/Problem Definition:Write an efficient program to count number of 1s in binary representation of an integer.So

reference: http://www.geeksforgeeks.org/compute-the-integer-absolute-value-abs-without-branching/Problem Definition:Compute the integer absolute value (abs) without branching.Solut