Array sum after dividing numbers from previous?

Here we will see one interesting problem. We will take one array, then find the sum by taking each element after dividing it by the previous elements. Let us consider an array is {5, 6, 7, 2, 1, 4}. Then the result will be 5 + (6 / 5) + (7 / 6) + (2 / 7) + (1 / 2) + (4 / 1) = 12.15238. Let us see the algorithm to get the concept.

Algorithm

divSum(arr, n)

begin
   sum := arr[0]
   for i := 1 to n-1, do
      sum := sum + arr[i] / arr[i-1]
   done
   return sum
end

Example

#include <iostream>
using namespace std;
float divSum(int arr[], int n){
   float sum = arr[0];
   for(int i = 1; i<n; i++){
      sum += arr[i] / float(arr[i - 1]);
   }
   return sum;
}
int main() {
   int arr[6] = {5, 6, 7, 2, 1, 4};
   int n = 6;
   cout << "Sum : " << divSum(arr, n);
}

Output

Sum : 12.1524

Arnab Chakraborty

Published on 01-Aug-2019 07:54:29

• Related Questions & Answers
• Array sum after dividing numbers from previous in C?
• Maximum subarray sum after dividing array into subarrays based on the given queries in Java
• Maximum sum after repeatedly dividing N by a divisor in C++
• Dividing an array – JavaScript
• Find the Initial Array from given array after range sum queries in C++
• Sum of Even Numbers After Queries in Python
• Maximize array sum after K negation in C++
• Prime numbers after prime P with sum S in C++
• Maximize Sum Of Array After K Negations in Python
• Count number of digits after decimal on dividing a number in C++
• Minimum sum of two numbers formed from digits of an array in C++
• Converting array of Numbers to cumulative sum array in JavaScript
• Getting MongoDB results from the previous month
• Program to find remainder after dividing n number of 1s by m in Python
• Counting smaller numbers after corresponding numbers in JavaScript