Program for multiplication of array elements - GeeksforGeeks

07 May, 2021
We are given an array, and we have to calculate the product of an array using both iterative and recursive methods. 
Examples:  
Input : array[] = {1, 2, 3, 4, 5, 6}
Output : 720
Here, product of elements = 1*2*3*4*5*6 = 720

Input : array[] = {1, 3, 5, 7, 9}
Output : 945 
Iterative Method: We initialize result as 1. We traverse array from left to right and multiply elements with results.  
C++
Java
Python3
C#
PHP
Javascript
// Iterative C++ program to// multiply array elements#include<bits/stdc++.h> using namespace std; // Function to calculate the// product of the arrayint multiply(int array[], int n){    int pro = 1;    for (int i = 0; i < n; i++)        pro = pro * array[i];    return pro;} // Driver Codeint main(){    int array[] = {1, 2, 3, 4, 5, 6};    int n = sizeof(array) / sizeof(array[0]);         // Function call to calculate product    cout << multiply(array, n);    return 0;}
// Iterative Java program to// multiply array elementsclass GFG{    static int arr[] = {1, 2, 3, 4, 5, 6};         // Method to calculate the    // product of the array    static int multiply()    {        int pro = 1;        for (int i = 0; i < arr.length; i++)            pro = pro * arr[i];        return pro;    }         // Driver Code    public static void main(String[] args)    {        // Method call to calculate product        System.out.println(multiply());        }}
# Iterative Python3 code to# multiply list elements # Function to calculate# the product of the arraydef multiply( array , n ):    pro = 1    for i in range(n):        pro = pro * array[i]    return pro # Driver codearray = [1, 2, 3, 4, 5, 6]n = len(array) # Function call to# calculate productprint(multiply(array, n)) # This code is contributed# by "Sharad_Bhardwaj".
// Iterative C# program to// multiply array elementsusing System; class GFG{    static int []arr = {1, 2, 3, 4, 5, 6};         // Method to calculate the    // product of the array    static int multiply()    {        int pro = 1;        for (int i = 0; i < arr.Length; i++)            pro = pro * arr[i];        return pro;    }         // Driver Code    public static void Main()    {        // Method call to calculate product        Console.Write(multiply());    }} // This code is contributed by nitin mittal
<?php// Iterative PHP program to// multiply array elements  // Function to calculate the// product of the arrayfunction multiply($arr, $n){    $pro = 1;    for ($i = 0; $i < $n; $i++)        $pro = $pro * $arr[$i];    return $pro;} // Driver Code$arr = array(1, 2, 3, 4, 5, 6);$n = sizeof($arr) / sizeof($arr[0]); // Function call to// calculate productecho multiply($arr, $n);return 0; // This code is contributed by nitin mittal.?>
<script> // Iterative javascript program to// multiply array elements     var arr = [ 1, 2, 3, 4, 5, 6 ];     // Method to calculate the    // product of the array    function multiply() {        var pro = 1;        for (i = 0; i < arr.length; i++)            pro = pro * arr[i];        return pro;    }     // Driver Code             // Method call to calculate product        document.write(multiply()); // This code contributed by aashish1995 </script>
Output : 
720
Recursive Method: 
C++
Java
Python3
C#
PHP
Javascript
// Recursive C++ program to// multiply array elements#include<iostream> using namespace std; // Function to calculate the// product of array using recursionint multiply(int a[], int n){    // Termination condition    if (n == 0)        return(a[n]);    else        return (a[n] * multiply(a, n - 1));} // Driver Codeint main(){    int array[] = {1, 2, 3, 4, 5, 6};    int n = sizeof(array) / sizeof(array[0]);     // Function call to    // calculate the product    cout << multiply(array, n - 1)         << endl;    return 0;}
// Recursive Java program to// multiply array elementsclass GFG{    static int arr[] = {1, 2, 3, 4, 5, 6};         // Method to calculate the product    // of the array using recursion    static int multiply(int a[], int n)    {        // Termination condition        if (n == 0)            return(a[n]);        else            return (a[n] * multiply(a, n - 1));    }         // Driver Code    public static void main(String[] args)    {        // Method call to        // calculate product        System.out.println(multiply(arr,                       arr.length - 1));        }}
# Recursive Python3 code# to multiply array elements # Function to calculate the product # of array using recursiondef multiply( a , n ):         # Termination condition    if n == 0:        return(a[n])    else:        return (a[n] * multiply(a, n - 1)) # Driver Codearray = [1, 2, 3, 4, 5, 6]n = len(array) # Function call to# calculate the productprint(multiply(array, n - 1)) # This code is contributed# by "Sharad_Bhardwaj".
// Recursive C# program to// multiply array elementsusing System; class GFG{         static int []arr = {1, 2, 3, 4, 5, 6};         // Method to calculate the product    // of the array using recursion    static int multiply(int []a, int n)    {                 // Termination condition        if (n == 0)            return(a[n]);        else            return (a[n] * multiply(a, n - 1));    }         // Driver Code    public static void Main()    {                 // Method call to        // calculate product        Console.Write(multiply(arr,                               arr.Length - 1));    }} // This code is contributed by Nitin Mittal.
<?php// Recursive PHP program to// multiply array elements // Function to calculate the// product of array using recursionfunction multiply( $a, $n){    // Termination condition    if ($n == 0)        return($a[$n]);    else        return ($a[$n] *                 multiply($a, $n - 1));} // Driver Code$array = array(1, 2, 3, 4, 5, 6);$n = count($array); // Function call to// calculate the productecho multiply($array, $n - 1)     // This code is contributed by anuj_67.?>
<script>// Recursive javascript program to// multiply array elements     var arr = [ 1, 2, 3, 4, 5, 6 ];     // Method to calculate the product    // of the array using recursion    function multiply(a , n) {        // Termination condition        if (n == 0)            return (a[n]);        else            return (a[n] * multiply(a, n - 1));    }     // Driver Code              // Method call to        // calculate product        document.write(multiply(arr,                       arr.length - 1)); // This code is contributed by todaysgaurav</script>
Output :  
720
This article is contributed by Rishabh Jain. If you like GeeksforGeeks and would like to contribute, you can also write an article using write.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above. 
nitin mittal
vt_m
aashish1995
todaysgaurav
CBSE - Class 11
school-programming
Arrays
School Programming
Arrays
Writing code in comment?
Please use ide.geeksforgeeks.org,
generate link and share the link here.
Comments
Old Comments
Stack Data Structure (Introduction and Program)
Top 50 Array Coding Problems for Interviews
Multidimensional Arrays in Java
Introduction to Arrays
Linear Search
Python Dictionary
Inheritance in C++
Reverse a string in Java
Interfaces in Java
C++ Classes and Objects