Computer Science, asked by manish4uanand, 1 month ago

Write a ruby progaram for the given problem.
Given an array of numbers, find the index of the
smallest array element (the pivot), for which the
sums of all elements to the left and to the right are
equal. The array may not be reordered.​

Answers

Answered by samiranoli10
0

Answer:

Write a ruby progaram for the given problem.

Given an array of numbers, find the index of the

smallest array element (the pivot), for which the

sums of all elements to the left and to the right are

equal. The array may not be reordered.

Similar questions