coding question: write a function that divide two integers without using the division operator to get the remainder and quotient
Anónimo
bitwise operator: right shift for quotien and modulo for remainder. you can use a loop and increment the count...