Implement integer division

Question

Gokul · Accepted Answer

I hope this will be helpful

int divFunc(int* num,int* den,int* rem)
{
    int q = 1;
    int backupNum = *num;
    int backupDen = *den;
    while((backupDen = backupDen >=1;
    backupNum = backupNum - backupDen;
    *num = backupNum;
    *rem = backupNum;
    return q;
}
void divide(num,den)
{
    int q=0,r=0;
    while(num>den)
    {
        q = q + divFunc(&num,&den,&r);
    }
    printf("Q = %d	 R = %d
",q,r);
    
}

Utilisateur anonyme · Answer

public class Solution {
	public void integerDivision(int num, int den){
		int q=0,rem=0;
		while(num>=den){
			num-=den;
			q++;
		}
		rem=num;
		System.out.println("Quotient "+q+" Remainder "+rem);
	}
	
	public static void main(String[] args) {
		Solution sol = new Solution();
		sol.integerDivision(73, 9);

	}

}

Naresh · Answer

public static int division(int a, int b) {
      if (a  b) {
         int q = 1;
         int c = b;
         while ((b = b > 1;
         while ((a = a - b) >= c) {
            q++;
         }
         return q;
      }  else {
         return 0;
      }
   }

Naresh · Answer

Minor correction

   public static int division(int a, int b) {
      if (a  b) {
         int q = 1;
         int c = b;
         while ((b = b > 1;
         while ((a = a - b) >= c) {
            q++;
         }
         return q;
      }  else {
         return 0;
      }
   }

Amazon

Question d’entretien chez Amazon

Réponses aux questions d'entretien

Entreprises suivies

Recherche d’emplois