Given an array **arr[]** where **arr[i]** is the concentration of juice in **i ^{th}** glass. The task is to find the concentration of the resultant mixture when all the glasses are mixed in equal proportions.

**Examples:**

Input:arr[] = {10, 20, 30}

Output:20

Input:arr[] = {0, 20, 20}

Output:13.3333

**Approach:** Since the juices are mixed in **equal** proportions so the resultant concentration will be the average of all the individual concentrations. Therefore the required answer would be **sum(arr) / n** where n is the size of the array.

Below is the implementation of the above approach:

## C++

`// C++ implementation of the approach ` `#include <bits/stdc++.h> ` `using` `namespace` `std; ` ` ` `// Function to return the concentration ` `// of the resultant mixture ` `double` `mixtureConcentration(` `int` `n, ` `int` `p[]) ` `{ ` ` ` `double` `res = 0; ` ` ` `for` `(` `int` `i = 0; i < n; i++) ` ` ` `res += p[i]; ` ` ` `res /= n; ` ` ` `return` `res; ` `} ` ` ` `// Driver code ` `int` `main() ` `{ ` ` ` `int` `arr[] = { 0, 20, 20 }; ` ` ` `int` `n = ` `sizeof` `(arr) / ` `sizeof` `(arr[0]); ` ` ` `cout << mixtureConcentration(n, arr); ` `} ` |

*chevron_right*

*filter_none*

## Java

`// Java implementation of the approach ` ` ` `class` `GFG ` `{ ` ` ` `// Function to return the concentration ` `// of the resultant mixture ` `static` `double` `mixtureConcentration(` `int` `n, ` `int` `[]p) ` `{ ` ` ` `double` `res = ` `0` `; ` ` ` `for` `(` `int` `i = ` `0` `; i < n; i++) ` ` ` `res += p[i]; ` ` ` `res /= n; ` ` ` `return` `res; ` `} ` ` ` `// Driver code ` `public` `static` `void` `main (String[] args) ` `{ ` ` ` ` ` `int` `[]arr = { ` `0` `, ` `20` `, ` `20` `}; ` ` ` `int` `n = arr.length; ` ` ` `System.out.println(String.format(` `"%.4f"` `, ` ` ` `mixtureConcentration(n, arr))); ` `} ` `} ` ` ` `// This code is contributed by chandan_jnu ` |

*chevron_right*

*filter_none*

## Python3

`# Python3 implementation of the approach ` ` ` `# Function to return the concentration ` `# of the resultant mixture ` `def` `mixtureConcentration(n, p): ` ` ` ` ` `res ` `=` `0` `; ` ` ` `for` `i ` `in` `range` `(n): ` ` ` `res ` `+` `=` `p[i]; ` ` ` `res ` `/` `=` `n; ` ` ` `return` `res; ` ` ` `# Driver code ` `arr ` `=` `[ ` `0` `, ` `20` `, ` `20` `]; ` `n ` `=` `len` `(arr); ` `print` `(` `round` `(mixtureConcentration(n, arr), ` `4` `)); ` ` ` `# This code is contributed ` `# by chandan_jnu ` |

*chevron_right*

*filter_none*

## C#

`// C# implementation of the approach ` `using` `System; ` ` ` `class` `GFG ` `{ ` ` ` `// Function to return the concentration ` `// of the resultant mixture ` `static` `double` `mixtureConcentration(` `int` `n, ` `int` `[]p) ` `{ ` ` ` `double` `res = 0; ` ` ` `for` `(` `int` `i = 0; i < n; i++) ` ` ` `res += p[i]; ` ` ` `res /= n; ` ` ` `return` `Math.Round(res,4); ` `} ` ` ` `// Driver code ` `static` `void` `Main() ` `{ ` ` ` `int` `[]arr = { 0, 20, 20 }; ` ` ` `int` `n = arr.Length; ` ` ` `Console.WriteLine(mixtureConcentration(n, arr)); ` `} ` `} ` ` ` `// This code is contributed by chandan_jnu ` |

*chevron_right*

*filter_none*

## PHP

`<?php ` `// PHP implementation of the approach ` ` ` `// Function to return the concentration ` `// of the resultant mixture ` `function` `mixtureConcentration(` `$n` `, ` `$p` `) ` `{ ` ` ` `$res` `= 0; ` ` ` `for` `(` `$i` `= 0; ` `$i` `< ` `$n` `; ` `$i` `++) ` ` ` `$res` `+= ` `$p` `[` `$i` `]; ` ` ` `$res` `/= ` `$n` `; ` ` ` `return` `$res` `; ` `} ` ` ` `// Driver code ` `$arr` `= ` `array` `( 0, 20, 20 ); ` `$n` `= ` `count` `(` `$arr` `); ` `print` `(` `round` `(mixtureConcentration(` `$n` `, ` `$arr` `), 4)); ` ` ` `// This code is contributed by chandan_jnu ` `?> ` |

*chevron_right*

*filter_none*

**Output:**

13.3333

**Time Complexity:** O(N)

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.

## Recommended Posts:

- Find the concentration of a solution using given Mass and Volume
- Minimum number of bottles required to fill K glasses
- Check whether the given integers a, b, c and d are in proportion
- Find array sum using Bitwise OR after splitting given array in two halves after K circular shifts
- Maximum count of equal numbers in an array after performing given operations
- Find the minimum value of m that satisfies ax + by = m and all values after m also satisfy
- Maximum value in an array after m range increment operations
- Date after adding given number of days to the given date
- Sort an array after applying the given equation
- Maximum score after flipping a Binary Matrix atmost K times
- Print matrix after applying increment operations in M ranges
- Count number of digits after decimal on dividing a number
- Find if two people ever meet after same number of jumps
- Number of triangles after N moves
- Number of visible boxes after putting one inside another
- Find the number of consecutive zero at the end after multiplying n numbers
- K-th smallest element after removing given integers from natural numbers | Set 2
- Number of odd and even results for every value of x in range [min, max] after performing N steps
- Maximum profit after buying and selling the stocks
- Maximum number of dots after throwing a dice N times

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. 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.