C Exercises: Find the equilibrium index of an array
C Array: Exercise-86 with Solution
Write a program in C to find the equilibrium index of an array.
Sample Solution:
C Code:
#include <stdio.h>
// Function to find equilibrium indices in the array
void findEquiIndex(int arr1[], int n)
{
int sumofleft[n]; // Initialize an array to store sums of elements to the left of each index
sumofleft[0] = 0; // Initialize the sum at index 0 as 0 (no elements to the left)
// Calculate the cumulative sum of elements to the left of each index
for (int i = 1; i < n; i++)
{
sumofleft[i] = sumofleft[i - 1] + arr1[i - 1]; // Sum of elements to the left of the current index
}
int sumofright = 0; // Initialize the sum of elements to the right as 0
// Traverse the array from right to left to check for equilibrium indices
for (int i = n - 1; i >= 0; i--)
{
if (sumofleft[i] == sumofright) // If the sum to the left matches the sum to the right
{
printf("%d ", i); // Print the index as equilibrium index
}
sumofright += arr1[i]; // Add the current element to the sum of elements to the right
}
}
int main()
{
int arr1[] = { 0, -4, 7, -4, -2, 6, -3, 0 };
int n = sizeof(arr1) / sizeof(arr1[0]);
int i;
// Print the original array
printf("The given array is: \n");
for (i = 0; i < n; i++)
{
printf("%d ", arr1[i]);
}
printf("\n");
// Find and print equilibrium indices
printf("The equilibrium index found at : ");
findEquiIndex(arr1, n);
return 0;
}
Sample Output:
The given array is: 0 -4 7 -4 -2 6 -3 0 The equilibrium index found at : 7 5 0
Visual Presentation:
Flowchart:

C Programming Code Editor:
Previous: Write a program in C to Count all possible paths from top left to bottom right of a m X n matrix.
Next: Write a program in C to find the maximum element in an array which is first increasing and then decreasing.
What is the difficulty level of this exercise?
Test your Programming skills with w3resource's quiz.
- Weekly Trends
- Python Interview Questions and Answers: Comprehensive Guide
- Scala Exercises, Practice, Solution
- Kotlin Exercises practice with solution
- MongoDB Exercises, Practice, Solution
- SQL Exercises, Practice, Solution - JOINS
- Java Basic Programming Exercises
- SQL Subqueries
- Adventureworks Database Exercises
- C# Sharp Basic Exercises
- SQL COUNT() with distinct
- JavaScript String Exercises
- JavaScript HTML Form Validation
- Java Collection Exercises
- SQL COUNT() function
- SQL Inner Join