“equilibrium point code” Code Answer

equilibrium point code

python by sree_007 on Dec 10 2020 Donate

# Python program to find equilibrium  
# index of an array 
  
# function to find the equilibrium index 
def equilibrium(arr): 
    leftsum = 0
    rightsum = 0
    n = len(arr) 
  
    # Check for indexes one by one  
    # until an equilibrium index is found 
    for i in range(n): 
        leftsum = 0
        rightsum = 0
      
        # get left sum 
        for j in range(i): 
            leftsum += arr[j] 
          
        # get right sum 
        for j in range(i + 1, n): 
            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
              
# driver code 
arr = [-7, 1, 5, 2, -4, 3, 0] 
print (equilibrium(arr))

equilibrium point code

whatever by sree_007 on Dec 10 2020 Donate

// Java program to find equilibrium 
// index of an array 
  
class EquilibriumIndex { 
    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) { 
  
            /* get left sum */
            leftsum = 0;   
            for (j = 0; j < i; j++) 
                leftsum += arr[j]; 
  
            /* get right sum */
            rightsum = 0; 
            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; 
    } 
    // Driver code 
    public static void main(String[] args) 
    { 
        EquilibriumIndex equi = new EquilibriumIndex(); 
        int arr[] = { -7, 1, 5, 2, -4, 3, 0 }; 
        int arr_size = arr.length; 
        System.out.println(equi.equilibrium(arr, arr_size)); 
    } 
}

Source: www.geeksforgeeks.org

equilibrium point code

cpp by sree_007 on Dec 10 2020 Donate

// C++ program to find equilibrium 
// index of an array 
#include <bits/stdc++.h> 
using namespace std; 
  
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)  
    {      
  
        /* get left sum */
        leftsum = 0;  
        for (j = 0; j < i; j++) 
            leftsum += arr[j]; 
  
        /* get right sum */
        rightsum = 0;  
        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; 
} 
  
// Driver code 
int main() 
{ 
    int arr[] = { -7, 1, 5, 2, -4, 3, 0 }; 
    int arr_size = sizeof(arr) / sizeof(arr[0]); 
    cout << equilibrium(arr, arr_size); 
    return 0; 
} 
  
//

C++ answers related to “equilibrium point code”

Learn how Grepper helps you improve as a Developer!

INSTALL GREPPER FOR CHROME

“equilibrium point code” Code Answer

C++ answers related to “equilibrium point code”

Learn how Grepper helps you improve as a Developer!

More “Kinda” Related C++ Answers View All C++ Answers »

Browse Other Code Languages

Grepper

Documentation

Social

Legal

Contact