Given two numbers, divide one from other without using ‘/’ operator.
Input : num1 = 13, num2 = 2 Output : 6 Input : num1 = 14, num2 = -2 Output : -7 Input : num1 = -11, num2 = 3 Output : -3 Input : num1 = 10, num2 = 10 Output : 1 Input : num1 = -6, num2 = -2 Output : 3 Input : num1 = 0, num2 = 5 Output : 0
In order to perform division operation without using ‘/’ operator we followed the approach, in which we count the number of successful or complete number of substraction of num2 from num1. Where num1 is the number to be divided and num2 is the number from which we have to divide num1.
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.
- Divide two integers without using multiplication, division and mod operator | Set2
- Multiply two integers without using multiplication, division and bitwise operators, and no loops
- Write you own Power without using multiplication(*) and division(/) operators
- Find Quotient and Remainder of two integer without using division operators
- Decimal to Binary using recursion and without using power operator
- To find sum of two numbers without using any operator
- Program to find remainder without using modulo or % operator
- Maximum OR value of a pair in an Array without using OR operator
- Maximize the division result of Array using given operations
- DFA based division
- Division Operators in Python
- Modular Division
- Program to compute division upto n decimal places
- Trick for modular division ( (x1 * x2 .... xn) / b ) mod (m)
- Find the number after successive division
- Number of digits before the decimal point in the division of two numbers
- Maximum value of division of two numbers in an Array
- Check if it is possible to perform the given Grid Division
- Trial division Algorithm for Prime Factorization
- Long Division Method to find Square root with Examples
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.