# The theory of division
When we divide an integer (D) by another integer (E), we obtain a quotient (Q) and remainder (R). Q represents the number of times that E occurs in D; in simpler terms, Q is the number of parts, of size E, that D can be broken into. Once all of ​these parts are taken out of D, the remaining part is the remainder.

# Algorithm and code
By this point, you should have realized that the quotient can be found by repeatedly subtracting E from D, and recording the number of times ​that this subtraction is performed.

def Divide(D,E):
  R = D
  Q = 0


  while R >= E:
    R = R - E
    Q += 1

  return Q

D = 11
E = 4
print("Quotient from our function: ",Divide(D,E))
print("Actual Quotient: ", D // E)

Python

#include <iostream>
using namespace std;

int Divide(int D, int E){
  int R = D;
  int Q = 0;

  while(R >= E)
  {
    R = R - E;
    Q++;
  }

  return Q;
}

int main(){
  int D = 11;
  int E = 5;

  cout<<"Quotient from our function: "<<Divide(D,E)<<endl;
  cout<<"Actual Quotient"<<D/E<<endl;

  return 0;
}

class Division_intuitively {
    static int Divide(int D, int E){
      int R = D;
      int Q = 0;

      while(R >= E){
        R = R - E;
        Q = Q + 1;        

      }
      
      return Q;
    }

    public static void main( String args[] ) {
      
      int D = 11;
      int E = 4;
      System.out.println("Quotient from our function: " + Divide(D, E));
      System.out.println("Actual Quotient: " + D/E);

    }
}

Java

How to divide integers without division/multiplication/modulo


Divide integers by repeatedly subtracting the divisor from the dividend, counting subtractions for the quotient.