   # What is equilibrium index of an array?

227 views

What is equilibrium index of an array and how to find it using a C program? posted May 7, 2014

Equilibrium index of an array is an index such that the sum of elements at lower indexes is equal to the sum of elements at higher indexes. For example, in an arrya A:

A = -7, A = 1, A = 5, A = 2, A = -4, A = 3, A=0

3 is an equilibrium index, because:
A + A + A = A + A + A

6 is also an equilibrium index, because sum of zero elements is zero, i.e., A + A + A + A + A + A=0

7 is not an equilibrium index, because it is not a valid index of array A.

Use two loops to implement it in C. Outer loop iterates through all the element and inner loop finds out whether the current index picked by the outer loop is equilibrium index or not. Time complexity of this solution is O(n^2).

``````#include <stdio.h>

int equilibrium(int arr[], int n)
{
int i, j;
int leftsum, rightsum;

/* Check for indexes one by one until an equilibrium
index is found */
for ( i = 0; i < n; ++i)
{
leftsum = 0;  // initialize left sum for current index i
rightsum = 0; // initialize right sum for current index i

/* get left sum */
for ( j = 0; j < i; j++)
leftsum  += arr[j];

/* get right sum */
for( j = i+1; j < n; j++)
rightsum += arr[j];

/* if leftsum and rightsum are same, then we are done */
if (leftsum == rightsum)
return i;
}

/* return -1 if no equilibrium index is found */
return -1;
}

int main()
{
int arr[] = {-7, 1, 5, 2, -4, 3, 0};
int arr_size = sizeof(arr)/sizeof(arr);
printf("%d\n", equilibrium(arr, arr_size));

getchar();
return 0;
}
`````` answer May 29, 2014
Similar Questions

1,1,2,2,2,6,6,6,7,7,7,7,7,7,7,8,8,9,9,9

Example:
Input = 1 Output=0 (First index of 1).
Input = 2 Output=2 (First index of 2).
Input = 6 Output= 5 (First index of 6).
Input = 7 Output= 8 (First index of 7).
Input = 8 Output=15 (First index of 8).
Input = 9 Output=17 (First index of 9).

Can we increase the size during run time? What if, we exceed the size of array elements?

+1 vote

Given an array of 1s and 0s which has all 1s first followed by all 0s. Find the number of 0s. Count the number of zeroes in the given array.