Compute average of two numbers without overflow
Last Updated :
18 Apr, 2024
Given two numbers A and B, such that 0 <= A <= B <= (231 - 1). Compute the average ((A + B) / 2) of the two numbers.
Examples:
Input: A = 1000000000, B = 2000000000
Output: 1500000000.000000
Explanation: (A + B)/2 = (1000000000+ 2000000000)/2 = 1500000000.000000
Input: A = 2000000000, B = 2000000001
Output: 2000000000.500000
Explanation: (A + B)/2 = (2000000000 + 2000000001)/2 = 2000000000.500000
Approach: To solve the problem, follow the below idea:
We know that average of two numbers A and B = (A + B) / 2 but if we try to compute the sum of A and B, it will lead to an overflow. So, we need to apply a different formula to compute the average. Since average of A and B is half of the sum of A and B. We can also compute average as (A/2) + (B/2).
Below is the implementation of the approach:
C++
#include <iostream>
using namespace std;
// Function to compute average of two numbers
double computeAverage(int a, int b) {
return (a / 2.0) + (b / 2.0);
}
// Driver code
int main() {
// Assigning maximum integer value
int a = 2000000000, b = 2000000001;
// Function to get the average of 2 numbers
printf("Average: %.6f", computeAverage(a, b));
return 0;
}
Java
// Java code to compute
// average of two numbers
import java.io.*;
class GFG {
// Function to compute average of two numbers
static double computeAverage(int a, int b)
{
return (a / 2.0) + (b / 2.0);
}
// Driver code
public static void main(String[] args)
{
// Assigning maximum integer value
int a = 2000000000, b = 2000000001;
// Function to get the average of 2 numbers
System.out.printf("Average: %.6f", computeAverage(a, b));
}
}
Python
# Function to compute average of two numbers
def compute_average(a, b):
return (a / 2.0) + (b / 2.0)
# Assigning maximum integer value
a, b = 2000000000, 2000000001
# Function to get the average of 2 numbers
print("Average: {:.6f}".format(compute_average(a, b)))
C#
using System;
class Program
{
// Function to compute average of two numbers
static double ComputeAverage(int a, int b)
{
return (a / 2.0) + (b / 2.0);
}
// Driver code
static void Main()
{
// Assigning maximum integer value
int a = 2000000000, b = 2000000001;
// Function to get the average of 2 numbers
Console.WriteLine("Average: {0:F6}", ComputeAverage(a, b));
}
}
JavaScript
// Function to compute average of two numbers
function computeAverage(a, b) {
// Using floating-point division to ensure accurate average
return (a / 2.0) + (b / 2.0);
}
// Main function
function main() {
// Assigning maximum integer value
const a = 2000000000, b = 2000000001;
// Call the computeAverage function to get the average of two numbers
console.log("Average:", computeAverage(a, b).toFixed(6));
}
// Call the main function to execute the program
main();
OutputAverage: 2000000000.500000
Time Complexity: O(1), the code will run in a constant time.
Auxiliary Space: O(1), no extra space is required, so it is a constant.
Approach 2:
We can also calculate the average of two numbers A and B using the formula: A + (B - A)/2.
Below is the implementation of the approach:
C++
#include <bits/stdc++.h>
using namespace std;
// Function to compute average of two numbers
double compute_average(int a, int b)
{
return a + (b - a) / 2.0;
}
// Driver code
int main()
{
// Assigning maximum integer value
int a = 2000000000, b = 2000000001;
// Function to get the average of 2 numbers
cout << "Average : " << fixed << compute_average(a, b)
<< endl;
return 0;
}
Java
public class ComputeAverage {
// Function to compute average of two numbers
public static double computeAverage(int a, int b) {
return a + (b - a) / 2.0;
}
// Driver code
public static void main(String[] args) {
// Assigning maximum integer value
int a = 2000000000, b = 2000000001;
// Function to get the average of 2 numbers
double avg = computeAverage(a, b);
// Format the output to display the double value without scientific notation
String formattedAvg = String.format("%.2f", avg);
System.out.println("Average : " + formattedAvg);
}
}
// This code is contributed by shivamgupta0987654321
Python
# Function to compute average of two numbers
def compute_average(a, b):
return a + (b - a) / 2.0
# Driver code
def main():
# Assigning maximum integer value
a, b = 2000000000, 2000000001
# Function to get the average of 2 numbers
print("Average : {:.2f}".format(compute_average(a, b)))
# Call the main function
main()
JavaScript
// Function to compute average of two numbers
function computeAverage(a, b) {
return a + (b - a) / 2.0;
}
// Driver code
function main() {
// Assigning maximum integer value
let a = 2000000000, b = 2000000001;
// Function to get the average of 2 numbers
console.log("Average : " + computeAverage(a, b).toFixed(2));
}
// Call the main function
main();
OutputAverage : 2000000000.500000
Time Complexity: O(1), the code will run in a constant time.
Auxiliary Space: O(1), no extra space is required, so it is a constant.
Similar Reads
DSA Tutorial - Learn Data Structures and Algorithms DSA (Data Structures and Algorithms) is the study of organizing data efficiently using data structures like arrays, stacks, and trees, paired with step-by-step procedures (or algorithms) to solve problems effectively. Data structures manage how data is stored and accessed, while algorithms focus on
7 min read
Quick Sort QuickSort is a sorting algorithm based on the Divide and Conquer that picks an element as a pivot and partitions the given array around the picked pivot by placing the pivot in its correct position in the sorted array. It works on the principle of divide and conquer, breaking down the problem into s
12 min read
Merge Sort - Data Structure and Algorithms Tutorials Merge sort is a popular sorting algorithm known for its efficiency and stability. It follows the divide-and-conquer approach. It works by recursively dividing the input array into two halves, recursively sorting the two halves and finally merging them back together to obtain the sorted array. Merge
14 min read
SQL Commands | DDL, DQL, DML, DCL and TCL Commands SQL commands are crucial for managing databases effectively. These commands are divided into categories such as Data Definition Language (DDL), Data Manipulation Language (DML), Data Control Language (DCL), Data Query Language (DQL), and Transaction Control Language (TCL). In this article, we will e
7 min read
Bubble Sort Algorithm Bubble Sort is the simplest sorting algorithm that works by repeatedly swapping the adjacent elements if they are in the wrong order. This algorithm is not suitable for large data sets as its average and worst-case time complexity are quite high.We sort the array using multiple passes. After the fir
8 min read
Data Structures Tutorial Data structures are the fundamental building blocks of computer programming. They define how data is organized, stored, and manipulated within a program. Understanding data structures is very important for developing efficient and effective algorithms. What is Data Structure?A data structure is a st
2 min read
Breadth First Search or BFS for a Graph Given a undirected graph represented by an adjacency list adj, where each adj[i] represents the list of vertices connected to vertex i. Perform a Breadth First Search (BFS) traversal starting from vertex 0, visiting vertices from left to right according to the adjacency list, and return a list conta
15+ min read
Binary Search Algorithm - Iterative and Recursive Implementation Binary Search Algorithm is a searching algorithm used in a sorted array by repeatedly dividing the search interval in half. The idea of binary search is to use the information that the array is sorted and reduce the time complexity to O(log N). Binary Search AlgorithmConditions to apply Binary Searc
15 min read
Insertion Sort Algorithm Insertion sort is a simple sorting algorithm that works by iteratively inserting each element of an unsorted list into its correct position in a sorted portion of the list. It is like sorting playing cards in your hands. You split the cards into two groups: the sorted cards and the unsorted cards. T
9 min read
Dijkstra's Algorithm to find Shortest Paths from a Source to all Given a weighted undirected graph represented as an edge list and a source vertex src, find the shortest path distances from the source vertex to all other vertices in the graph. The graph contains V vertices, numbered from 0 to V - 1.Note: The given graph does not contain any negative edge. Example
12 min read