recursion - Recursive function that divides the number by 2 without using /

Question

I need help. I need to create a recursive function that receives a "n" number and returns "n/2" without dividing.

Edit :

This is what I wrote, but it works only if after dividing it will still be a decimal number and not a float, that's why I asked.

int recursive(int a, int b)
{ 
  if ( a == (0.5 * b) )
    return a;

  return recursive(a-1, b);
}

Answer 1

Recursive solutions are much slower, but here's an implementation for positive integers using python 3

def divRecursive(a,b):
    if a<b:
        return 0
    return 1+divRecursive(a-b,b)