Skip to content
Related Articles

Related Articles

Improve Article

Program for multiplication of array elements

  • Difficulty Level : Easy
  • Last Updated : 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++




// Iterative C++ program to
// multiply array elements
#include<bits/stdc++.h>
 
using namespace std;
 
// Function to calculate the
// product of the array
int multiply(int array[], int n)
{
    int pro = 1;
    for (int i = 0; i < n; i++)
        pro = pro * array[i];
    return pro;
}
 
// Driver Code
int 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;
}
Java



// Iterative Java program to
// multiply array elements
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(String[] args)
    {
        // Method call to calculate product
        System.out.println(multiply());
        }
}
Python3



# Iterative Python3 code to
# multiply list elements
 
# Function to calculate
# the product of the array
def multiply( array , n ):
    pro = 1
    for i in range(n):
        pro = pro * array[i]
    return pro
 
# Driver code
array = [1, 2, 3, 4, 5, 6]
n = len(array)
 
# Function call to
# calculate product
print(multiply(array, n))
 
# This code is contributed
# by "Sharad_Bhardwaj".
C#



// Iterative C# program to
// multiply array elements
using 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



<?php
// Iterative PHP program to
// multiply array elements
 
 
// Function to calculate the
// product of the array
function 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 product
echo multiply($arr, $n);
return 0;
 
// This code is contributed by nitin mittal.
?>
Javascript



<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++



// Recursive C++ program to
// multiply array elements
#include<iostream>
 
using namespace std;
 
// Function to calculate the
// product of array using recursion
int multiply(int a[], int n)
{
    // Termination condition
    if (n == 0)
        return(a[n]);
    else
        return (a[n] * multiply(a, n - 1));
}
 
// Driver Code
int 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;
}
Java



// Recursive Java program to
// multiply array elements
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(String[] args)
    {
        // Method call to
        // calculate product
        System.out.println(multiply(arr,
                       arr.length - 1));
        }
}
Python3



# Recursive Python3 code
# to multiply array elements
 
# Function to calculate the product 
# of array using recursion
def multiply( a , n ):
     
    # Termination condition
    if n == 0:
        return(a[n])
    else:
        return (a[n] * multiply(a, n - 1))
 
# Driver Code
array = [1, 2, 3, 4, 5, 6]
n = len(array)
 
# Function call to
# calculate the product
print(multiply(array, n - 1))
 
# This code is contributed
# by "Sharad_Bhardwaj".
C#



// Recursive C# program to
// multiply array elements
using 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



<?php
// Recursive PHP program to
// multiply array elements
 
// Function to calculate the
// product of 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
$array = array(1, 2, 3, 4, 5, 6);
$n = count($array);
 
// Function call to
// calculate the product
echo multiply($array, $n - 1)
     
// This code is contributed by anuj_67.
?>
Javascript



<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.
 
Attention reader! Don’t stop learning now. Join the First-Step-to-DSA Course for Class 9 to 12 students , specifically designed to introduce data structures and algorithms to the class 9 to 12 students



My Personal Notes
arrow_drop_up
Previous
Convert characters of a string to opposite case
Next

Number of subarrays for which product and sum are equal
Recommended Articles
Page :
Right most non-zero digit in multiplication of array elements
20, Aug 19
Program to print multiplication table of a number
06, Sep 17
Program for scalar multiplication of a matrix
17, Apr 18
Count divisors of array multiplication
30, Sep 17
Find remainder of array multiplication divided by n
27, Dec 17
Find the element whose multiplication with -1 makes array sum 0
08, Dec 18
Multiplication on Array : Range update query in O(1)
28, Nov 19
Find minimum number K such that sum of array after multiplication by K exceed S
29, Apr 20
Replace every array element by multiplication of previous and next
04, May 15
Maximum number of multiplication by 3 or division by 2 operations possible on an array
26, Jun 21
Multiplication of two complex numbers given as strings
01, Jan 18
Multiplication table till N rows where every Kth row is table of K upto Kth term
27, Feb 20
Minimum steps to convert X to Y by repeated division and multiplication
09, Jul 20
Product of Complex Numbers using three Multiplication Operation
30, Jun 20
Factorial of a number without using multiplication
23, Jun 21
Sum of array elements possible by appending arr[i] / K to the end of the array K times for array elements divisible by K
19, Apr 21
Count of Array elements greater than all elements on its left and next K elements on its right
05, Aug 20
Count of Array elements greater than all elements on its left and at least K elements on its right
29, Jul 20
Modify array to another given array by replacing array elements with the sum of the array
12, Feb 21
Map elements of an array to elements of another array
16, Nov 18
Sum of elements in 1st array such that number of elements less than or equal to them in 2nd array is maximum
17, Apr 19
Count of Array elements greater than or equal to twice the Median of K trailing Array elements
05, Aug 20
Count array elements that can be represented as sum of at least two consecutive array elements
08, Sep 20
Maximize sum of odd-indexed array elements by repeatedly selecting at most 2*M array elements from the beginning
23, May 21
Article Contributed By :
https://media.geeksforgeeks.org/auth/avatar.png
GeeksforGeeks
Vote for difficulty
Current difficulty :
Easy





Improved By :
Article Tags :
Practice Tags :
Report Issue

We use cookies to ensure you have the best browsing experience on our website. By using our site, you
acknowledge that you have read and understood our
Cookie Policy &
        Privacy Policy

Lightbox