Program to find quotient and remainder

Program to find quotient and remainder in C++

Now, we will solve this problem on how to find quotient and remainder in C++ using many different methods. These methods are as follows:

Using / and % operators

First, let's start with a straightforward program to find quotient and remainder in C++ using in-built division(/) and modulus(%) operators. A brief description of these operators is listed below in the table.

Code:

#include <iostream>
using namespace std;


// Function to find quotient and remainder
void findQuotientAndRemainder(int a, int b)
{
    // Find quotient and remainder
    int quotient = a / b;
    int remainder =  a % b;


    cout<<"Quotient = "<<quotient<<" and Remainder = "<<remainder<<endl;


    return;
}
 
// Driver Code
int main()
{
    // Given two number
    int dividend = 45, divisor = 7;
 
    // Function call
    findQuotientAndRemainder(dividend , divisor );
    findQuotientAndRemainder(7, 3);
    return 0;
}

You can also try this code with Online C++ Compiler

Run Code

The above code will find quotient and remainder using modulus operators. The output of the above code is displayed below:

Output

Time Complexity: O(1) because we find quotient and remainder using /and % operator in constant time.

Space Complexity: O(1) because only two extra variables are used.

Also read -  Decimal to Binary c++

Using the Remainder formula

Here, simply, we will use the remainder formula. The remainder formula will help us calculate the remainder obtained after dividing any two values. 

Remainder Formula: Dividend = Divisor × Quotient + Remainder.

We can now implement this approach.

Code:

#include <iostream>
using namespace std;


// Function to find quotient and remainder
void findQuotientAndRemainder(int a, int b)
{
    // Find quotient and remainder
    int quotient = a / b;
    int remainder =  a - (quotient*b);


    cout<<"Quotient = "<<quotient<<" and Remainder = "<<remainder<<endl;


    return;
}
 
// Driver Code
int main()
{
    // Given two number
    int dividend = 45, divisor = 7;
 
    // Function call
    findQuotientAndRemainder(dividend , divisor );
    findQuotientAndRemainder(7, 3);
    return 0;
}

You can also try this code with Online C++ Compiler

Run Code

The above code will find quotient and remainder using the classic remainder formula. The output of the above code will be the same as method 1.

Output

Time Complexity: O(1) because we just did simple mathematical operations in constant time.

Space Complexity: O(1) because only two extra variables are used.

Try and compile with online c++ compiler.

Must Read Dynamic Binding in C++

FAQs

1. Which is the best method to find quotient and remainder in C++?
   The best method to find quotient and remainder in C++ is by using the / and % operator as the remainder formulae method may fail for larger numbers as (quotient*b) may exceed the supported range. Both methods have the same time complexity of O(1) and are very easy to implement.
    
2. What are the disadvantages of using the remainder formula method to find quotient and remainder in C++?
   The main disadvantage of using the remainder formula method is that this method may fail for larger numbers as (quotient*b) may exceed the supported range.
    
3. What is the disadvantage of using % for finding remainder?
   The modulus operator % computes the remainder when one integer is divided by another (modulus operator cannot be used for floating-type variables).
    
4. What is the remainder function in C++?
   The remainder() function in C++ can compute the floating-point remainder of numerator/denominator (rounded to nearest).

Key Takeaways

In this article, we have extensively discussed how to find quotient and remainder in C++ using different-different methods.

We hope that this blog has helped you enhance your knowledge on how to find quotient and remainder in C++, and if you would like to learn more, check out our articles on STL containers in C++, Data Types in C++, and Implementing Sets Without C++ STL Containers. Do upvote our blog to help other ninjas grow. Happy Coding!