Open In App
Related Articles

Modulus of two float or double numbers

Improve Article
Improve
Save Article
Save
Like Article
Like

Given two floating-point numbers, find the remainder.

Examples: 

Input: a = 36.5, b = 5.0 
Output: 1.5

Input: a = 9.7, b = 2.3 
Output: 0.5 

Recommended Practice

A simple solution is to do repeated subtraction. 

C++




// C++ program to find modulo of floating
// point numbers.
#include <bits/stdc++.h>
using namespace std;
 
double findMod(double a, double b)
{
    double mod;
    // Handling negative values
    if (a < 0)
        mod = -a;
    else
        mod =  a;
    if (b < 0)
        b = -b;
 
    // Finding mod by repeated subtraction
     
    while (mod >= b)
        mod = mod - b;
 
    // Sign of result typically depends
    // on sign of a.
    if (a < 0)
        return -mod;
 
    return mod;
}
 
// Driver Function
int main()
{
    double a = 9.7, b = 2.3;
    cout << findMod(a, b);
    return 0;
}


Java




// Java program to find modulo of floating
// point numbers
 
class GFG
{
    static double findMod(double a, double b)
    {
        // Handling negative values
        if (a < 0)
            a = -a;
        if (b < 0)
            b = -b;
     
        // Finding mod by repeated subtraction
        double mod = a;
        while (mod >= b)
            mod = mod - b;
     
        // Sign of result typically depends
        // on sign of a.
        if (a < 0)
            return -mod;
     
        return mod;
    }
     
    // Driver code
    public static void main (String[] args)
    {
        double a = 9.7, b = 2.3;
        System.out.print(findMod(a, b));
    }
}
 
// This code is contributed by Anant Agarwal.


Python3




# Python3 program to find modulo
# of floating point numbers.
 
def findMod(a, b):
 
    # Handling negative values
    if (a < 0):
        a = -a
    if (b < 0):
        b = -b
 
    # Finding mod by repeated subtraction
    mod = a
    while (mod >= b):
        mod = mod - b
 
    # Sign of result typically
    # depends on sign of a.
    if (a < 0):
        return -mod
 
    return mod
 
# Driver code
a = 9.7; b = 2.3
print(findMod(a, b))
 
# This code is contributed by Anant Agarwal.


C#




// C# program to find modulo of floating
// point numbers
using System;
 
class GFG {
     
    static double findMod(double a, double b)
    {
         
        // Handling negative values
        if (a < 0)
            a = -a;
        if (b < 0)
            b = -b;
     
        // Finding mod by repeated subtraction
        double mod = a;
        while (mod >= b)
            mod = mod - b;
     
        // Sign of result typically depends
        // on sign of a.
        if (a < 0)
            return -mod;
     
        return mod;
    }
     
    // Driver code
    public static void Main ()
    {
         
        double a = 9.7, b = 2.3;
         
        Console.WriteLine(findMod(a, b));
    }
}
 
// This code is contributed by vt_m.


Javascript




<script>
 
// Javascript program to find
// modulo of floating point numbers.
 
function findMod(a, b)
{
    let mod;
    // Handling negative values
    if (a < 0)
        mod = -a;
    else
        mod =  a;
    if (b < 0)
        b = -b;
 
    // Finding mod by
    // repeated subtraction
     
    while (mod >= b)
        mod = mod - b;
 
    // Sign of result typically
    // depends on sign of a.
    if (a < 0)
        return -mod;
 
    return mod;
}
 
// Driver Function
 
    let a = 9.7, b = 2.3;
    document.write(findMod(a, b));
 
//This code is contributed by Mayank Tyagi
</script>


PHP




<?php
// PHP program to find modulo 
// of floatingpoint numbers.
 
function findMod($a, $b)
{
     
    // Handling negative values
    if ($a < 0)
        $a = -$a;
    if ($b < 0)
        $b = -$b;
 
    // Finding mod by repeated
    // subtraction
    $mod = $a;
    while ($mod >= $b)
        $mod = $mod - $b;
 
    // Sign of result typically
    // depends on sign of a.
    if ($a < 0)
        return -$mod;
 
    return $mod;
}
 
    // Driver Code
    $a = 9.7; $b = 2.3;
    echo findMod($a, $b);
     
// This code is contributed by anuj_65.
?>


Output

0.5






We can use the inbuilt fmod function to find the modulus of two floating-point numbers. 

C++




// CPP program to find modulo of floating
// point numbers using library function.
#include <bits/stdc++.h>
using namespace std;
 
// Driver Function
int main()
{
    double a = 9.7, b = 2.3;
    cout << fmod(a, b);
    return 0;
}


Java




// JAVA program to find modulo of floating
// point numbers using library function.
import java.util.*;
 
class GFG{
 
// Driver Function
public static void main(String[] args)
{
    double a = 9.7, b = 2.3;
    System.out.print((a % b));
}
}
 
// This code contributed by umadevi9616


Python3




# Python3 program to find modulo of floating
# point numbers using library function.
from math import fmod
 
# Driver code
if __name__ == '__main__':
     
    a = 9.7
    b = 2.3
     
    print(fmod(a, b))
 
# This code is contributed by mohit kumar 29


C#




// C# program to find modulo of floating
// point numbers using library function.
using System;
 
class GFG{
   
static void Main()
{
    double a = 9.7;
    double b = 2.3;
    Console.WriteLine(a % b);
}
}
 
// This code is contributed by mukesh07


Javascript




<script>
 
// Javascript program to find modulo of
// floating point numbers using
// library function.
 
// Driver Code
let a = 9.7;
let b = 2.3;
document.write(a%b);
 
// This code is contributed by mohan pavan
 
</script>


PHP




<?php
// PHP program to find modulo of
// floating point numbers using
// library function.
 
// Driver Code
$a = 9.7; $b = 2.3;
echo fmod($a, $b);
 
// This code is contributed
// by inder_verma
?>


Output

0.5






Using the abs() function :

Approach:

The abs() function returns the absolute value of a number, which in this case, will be the modulus of the two given floating-point numbers.

  • Import the time module to measure the time taken by the program.
  • Assign the floating-point numbers to the variables a and b.
  • Use the time.time() function to record the start time of the program.
  • Calculate the modulus of a and b using the % operator and the abs() function.
  • Use the time.time() function again to record the end time of the program.
  • Print the modulus of a and b, along with the message “Modulus of a and b is:”.
  • Print the time taken by the program, along with the message “Time taken:”.

C++




#include <iostream>
#include <cmath>
#include <chrono>
 
int main() {
    double a = 9.7;
    double b = 2.3;
 
    std::chrono::steady_clock::time_point start_time = std::chrono::steady_clock::now();
    double modulus = std::abs(std::fmod(a, b));
    std::chrono::steady_clock::time_point end_time = std::chrono::steady_clock::now();
 
    std::cout << "Modulus of " << a << " and " << b << " is: " << modulus << std::endl;
    std::cout << "Time taken: " << std::chrono::duration_cast<std::chrono::milliseconds>(end_time - start_time).count() / 1000.0 << " seconds" << std::endl;
 
    return 0;
}


Java




import java.time.Duration;
import java.time.Instant;
 
public class Main {
    public static void main(String[] args) {
        double a = 9.7;
        double b = 2.3;
 
        Instant startTime = Instant.now();  // Record the start time
        double modulus = Math.abs(a % b);  // Calculate the modulus
        Instant endTime = Instant.now();  // Record the end time
 
        System.out.println("Modulus of " + a + " and " + b + " is: " + modulus);
         
        // Calculate and print the time taken in seconds
        double durationInSeconds = Duration.between(startTime, endTime).toMillis() / 1000.0;
        System.out.println("Time taken: " + durationInSeconds + " seconds");
    }
}


Python3




import time
 
a = 9.7
b = 2.3
 
start_time = time.time()
modulus = abs(a % b)
end_time = time.time()
 
print("Modulus of", a, "and", b, "is:", modulus)
print("Time taken:", end_time - start_time, "seconds")


Output

Modulus of 9.7 and 2.3 is: 0.5
Time taken: 1.1682510375976562e-05 seconds







Time Complexity: O(1)
Space Complexity: O(1)


Whether you're preparing for your first job interview or aiming to upskill in this ever-evolving tech landscape, GeeksforGeeks Courses are your key to success. We provide top-quality content at affordable prices, all geared towards accelerating your growth in a time-bound manner. Join the millions we've already empowered, and we're here to do the same for you. Don't miss out - check it out now!

Last Updated : 21 Sep, 2023
Like Article
Save Article
Previous
Next
Similar Reads
Complete Tutorials