Dividing by power of 2 using bit shifting

Question

I\'ve got the following task:

Compute x/(2^n), for 0 <= n <= 30 using bit shifting.

Requirement: Round toward zero

Answer 1

public int DivideByPowerOf2(int x, int n)
    {

        return (x + ((x >> 31) & ((1 << n) + ~0))) >> n;
    }