Re: [algogeeks] Divide 2 nos. without DIVISON

2011-05-23 Thread ankit sambyal
here is the working code : #includestdio.h 8: int dividend, divisor, remainder; 9: 10: /* Division function Computes the quotient and remainder of two numbers 11: using bit shifting */ 12: int division(int tempdividend, int tempdivisor) { 13: 14: int quotient = 1; 15: 16: if

[algogeeks] Divide 2 nos. without DIVISON

2011-05-22 Thread punnu
Given 2 nos. we need to divide them without performing divison. Please give a better solution than subtracting the nos. again and again. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to