Reichweite und Koeffizient der Reichweite des Arrays
Bei einem Array arr aus ganzzahligen Elementen besteht die Aufgabe darin, den Bereich und den Koeffizienten des Bereichs des gegebenen Arrays zu finden, wobei gilt:
Bereich: Differenz zwischen dem Maximalwert und dem Minimalwert in der Verteilung.
Bereichskoeffizient: (Max – Min) / (Max + Min).
Beispiele:
Eingabe: arr[] = {15, 16, 10, 9, 6, 7, 17}
Ausgabe: Bereich: 11
Koeffizient des Bereichs: 0,478261
Max = 17, Min = 6
Bereich = Max – Min = 17 – 6 = 11
Koeffizient des Bereichs = (Max – Min) / (Max + Min) = 11 / 23 = 0,478261
Eingabe: arr[] = {5, 10, 15}
Ausgabe: Bereich: 10
Koeffizient des Bereichs: 0,5
Ansatz: Finden Sie das maximale und minimale Element aus dem gegebenen Array und berechnen Sie die Reichweite und den Koeffizienten der Reichweite wie folgt:
- Bereich = Max – Min
- Reichweitenkoeffizient = (Max – Min) / (Max + Min)
Unten ist die Implementierung des obigen Ansatzes:
C++
// C++ implementation to find // Range and coefficient of range #include <iostream> #include <numeric> using namespace std; // Function to return the minimum element from the array float getMin(float arr[], int n) { float res = arr[0]; for (int i = 1; i < n; i++) res = min(res, arr[i]); return res; } // Function to return the maximum element from the array float getMax(float arr[], int n) { float res = arr[0]; for (int i = 1; i < n; i++) res = max(res, arr[i]); return res; } // Function to print the Range and // Coefficient of Range in the given array void findRangeAndCoefficient(float arr[], int n) { float max = getMax(arr, n); float min = getMin(arr, n); float range = max - min; float coeffOfRange = range / (max + min); cout << "Range : " << range << endl; cout << "Coefficient of Range : " << coeffOfRange; } // Driver code int main() { float arr[] = { 5, 10, 15 }; int n = sizeof(arr) / sizeof(arr[0]); findRangeAndCoefficient(arr, n); return 0; }
Java
// Java implementation to find // Range and coefficient of range import java.io.*; class GFG { // Function to return the minimum element from the array static float getMin(float arr[], int n) { float res = arr[0]; for (int i = 1; i < n; i++) res = Math.min(res, arr[i]); return res; } // Function to return the maximum element from the array static float getMax(float arr[], int n) { float res = arr[0]; for (int i = 1; i < n; i++) res = Math.max(res, arr[i]); return res; } // Function to print the Range and // Coefficient of Range in the given array static void findRangeAndCoefficient(float arr[], int n) { float max = getMax(arr, n); float min = getMin(arr, n); float range = max - min; float coeffOfRange = range / (max + min); System.out.println("Range : " + range ); System.out.println("Coefficient of Range : " + coeffOfRange); } // Driver code public static void main (String[] args) { float arr[] = { 5, 10, 15 }; int n = arr.length; findRangeAndCoefficient(arr, n); } }
Python3
# Python 3 implementation to find # Range and coefficient of range # Function to return the minimum # element from the array def getMin(arr, n): res = arr[0] for i in range(1, n, 1): res = min(res, arr[i]) return res # Function to return the maximum # element from the array def getMax(arr, n): res = arr[0] for i in range(1, n, 1): res = max(res, arr[i]) return res # Function to print the Range and # Coefficient of Range in the given array def findRangeAndCoefficient(arr, n): max = getMax(arr, n) min = getMin(arr, n) range = max - min coeffOfRange = range / (max + min) print("Range :", range) print("Coefficient of Range :", coeffOfRange) # Driver code if __name__ == '__main__': arr = [5, 10, 15] n = len(arr) findRangeAndCoefficient(arr, n) # This code is contributed by # Surendra_Gangwar
C#
// C# implementation to find // Range and coefficient of range using System; public class GFG{ // Function to return the minimum element from the array static float getMin(float []arr, int n) { float res = arr[0]; for (int i = 1; i < n; i++) res = Math.Min(res, arr[i]); return res; } // Function to return the maximum element from the array static float getMax(float []arr, int n) { float res = arr[0]; for (int i = 1; i < n; i++) res = Math.Max(res, arr[i]); return res; } // Function to print the Range and // Coefficient of Range in the given array static void findRangeAndCoefficient(float []arr, int n) { float max = getMax(arr, n); float min = getMin(arr, n); float range = max - min; float coeffOfRange = range / (max + min); Console.WriteLine ("Range : " + range ); Console.WriteLine ("Coefficient of Range : " + coeffOfRange); } // Driver code static public void Main (){ float []arr = { 5, 10, 15 }; int n = arr.Length; findRangeAndCoefficient(arr, n); } //This code is contributed by akt_mit. }
PHP
<?php // PHP implementation to find // Range and coefficient of range // Function to return the minimum // element from the array function getMin($arr, $n) { $res = $arr[0]; for ($i = 1; $i < $n; $i++) $res = min($res, $arr[$i]); return $res; } // Function to return the maximum // element from the array function getMax($arr, $n) { $res = $arr[0]; for ($i = 1; $i < $n; $i++) $res = max($res, $arr[$i]); return $res; } // Function to print the Range and // Coefficient of Range in the given array function findRangeAndCoefficient($arr, $n) { $max = getMax($arr, $n); $min = getMin($arr, $n); $range = $max - $min; $coeffOfRange = $range / ($max + $min); echo "Range : ", $range, "\n"; echo "Coefficient of Range : ", $coeffOfRange; } // Driver code $arr = array( 5, 10, 15 ); $n = sizeof($arr); findRangeAndCoefficient($arr, $n); // This code is contributed by jit_t ?>
Javascript
<script> // Javascript implementation to find // Range and coefficient of range // Function to return the minimum // element from the array function getMin(arr, n) { let res = arr[0]; for (let i = 1; i < n; i++) res = Math.min(res, arr[i]); return res; } // Function to return the maximum // element from the array function getMax(arr, n) { let res = arr[0]; for (let i = 1; i < n; i++) res = Math.max(res, arr[i]); return res; } // Function to print the Range and // Coefficient of Range in the given array function findRangeAndCoefficient(arr, n) { let max = getMax(arr, n); let min = getMin(arr, n); let range = max - min; let coeffOfRange = range / (max + min); document.write("Range : " + range + "</br>"); document.write("Coefficient of Range : " + coeffOfRange + "</br>"); } let arr = [ 5, 10, 15 ]; let n = arr.length; findRangeAndCoefficient(arr, n); </script>
Reichweite: 10 Reichweitenkoeffizient: 0,5
Zeitkomplexität : O(n) Hilfsraum : O(1)