Algorithms & Data Structure- Data Structures and Algorithms Made Easy in Java

Question

1. Write an algorithm to store N numbers in an array. Find the product of the elements of the array that are odd.

Answer 1

Array[n] \\Array contains integers

Odd_Array[]

for I to n:

    if Array[i]&1==1 then

            Odd_Array.append(Array[i])

for i to n:

     for j to m:

           print(Odd_Array[i]*Odd_Array[j])

           

 

Comments

To find product of all elements in the odd_Array, why two loops required?