Program for multiplication of array elements

We are given an array and we have to calculate the product of an array using both iterative and recursive method.

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 result.

C++

// Iterative C++ program to multiply array elements
#include<iostream>
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 function
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 Test
{
	 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 method
	 public static void main(String[] args) 
	 {
		//Method call to calculate product
		System.out.println(multiply());
   	 }
 }


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 function
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 Test
{
	 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 method
	 public static void main(String[] args) 
	 {
		//Method call to calculate product
		System.out.println(multiply(arr,arr.length-1));
   	 }
 }
 720

This article is contributed by Rishabh Jain. 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 write comments if you find anything incorrect, or you want to share more information about the topic discussed above.

GATE CS Corner    Company Wise Coding Practice

Recommended Posts:







Writing code in comment? Please use ide.geeksforgeeks.org, generate link and share the link here.