dividing a number without using division operator in c [duplicate]

Answer 1

your question is very vague, but I can give you a particular case of dividing a number with 2. it can be performed by a bit shift operation that shifts the number one place to the right. This is a form of strength reduction optimization.

For example, 1101000 in binary (the decimal number 104), shifted one place to the right, is 0110100 (the decimal number 52): the lowest order bit, a 1, is removed. Similarly, division by any power of two (2 pow k) may be performed by right-shifting k positions. Because bit shifts are often much faster operations than division.

code to test that :

#include 

main()
{
   int i = 104; 
   int k = 3; //
   int j = i >> k ; //==>  i / 2 pow k 
  printf("j = %d \n",j);
}