# Minimum number of Merge Operations to make an Array Palindrome in C

## Minimum number of merge operations

Here, in this section we discuss code for finding Minimum number of merge operations to make array palindrome.
We are given with an array of positive integers. If array is not a palindrome, make merge operations and prints the number of merge operations. In each merge operation it will merge two adjacent elements. Here, merging two elements means replacing them with their sum.

A palindrome is a word, phrase, or sequence that reads the same backwards as forwards. ## Minimum Merge Operations To Make Array Palindrome

### Algorithm :

• Take the size of array from the user and store it in variable named n.
• Declare an array of size n and take n integer values from the user.
• Create two variables i,j. i will point to the start of the array and j to the end.
• Run a loop till i less then or equal to j.
• If arr[i] = arr[j], then there is no need to merge the elements. Increment i and decrement j
• If arr[i] > arr[j], then do merge operation at index j ie, arr[j-1] = arr[j-1] + arr[j], decrement j and increment the no of merge operations count by 1
• If arr[i] < arr[j], then do merge operation at index i ie, arr[i+1] = arr[i+1] + arr[i], increment i and increment the no of merge operations count by 1 ## Code in C, based on above algorithm

Run
```#include <stdio.h>

int MinOps (int arr[], int n)
{
int ans = 0;

for (int i = 0, j = n - 1; i <= j;)
{
if (arr[i] == arr[j])
{
i++;
j--;
}

else if (arr[i] > arr[j])
{
j--;
arr[j] += arr[j + 1];
ans++;
}

else
{
i++;
arr[i] += arr[i - 1];
ans++;
}
}

return ans;
}

int main ()
{
int n;
printf ("Enter the number of elements ");
scanf ("%d", &n);

int arr[n];

printf ("Enter the elements ");
for (int i = 0; i < n; i++)
{
scanf ("%d", &arr[i]);
}
printf ("Count of minimum operations is %d", MinOps (arr, n));

return 0;
}
```

### Output:

```Enter the number of elements 4
Enter the elements 1 2 3 1
Count of minimum operations is 1```

### Related Banners

Get PrepInsta Prime & get Access to all 200+ courses offered by PrepInsta in One Subscription

## Get over 200+ course One Subscription

Courses like AI/ML, Cloud Computing, Ethical Hacking, C, C++, Java, Python, DSA (All Languages), Competitive Coding (All Languages), TCS, Infosys, Wipro, Amazon, DBMS, SQL and others

## Checkout list of all the video courses in PrepInsta Prime Subscription

### Traversals

• Traversal in Trees
• Tree Traversals: Breadth-First Search (BFS) :
C | C++ | Java
• Tree Traversals: Depth First Search (DFS) :
C | C++ | Java
• Construct a Binary Tree from Postorder and Inorder

### AVL Trees

• AVL Trees
• AVL Trees: Introduction
• AVL Tree Insertion :
C | C++ | Java
• AVL Tree Deletion :
C | C++ | Java
• Insertion in a Binary Tree (Level Order) –
C | C++ | Java
• Searching in Binary Tree –
C | C++ | Java
• Searching in a Binary Search Tree –
C | C++ | Java

### Complete Programs for Trees

• Depth First Traversals –
C | C++ | Java
• Level Order Traversal –
C | C++Java
• Construct Tree from given Inorder and Preorder traversals –
C | C++Java
• Construct Tree from given Postorder and Inorder traversals –
C | C++Java
• Construct Tree from given Postorder and Preorder traversal –
C | C++Java
• Find size of the Binary tree –
C | C++Java
• Find the height of binary tree –
C | C++Java
• Find maximum in binary tree –
C | C++Java
• Check whether two tree are identical-
CC++Java
• Spiral Order traversal of Tree-
CC++Java
• Level Order Traversal Line by Line –
C | C++Java
• Hand shaking lemma and some Impotant Tree Properties.
• Check If binary tree if Foldable or not.-
CC++Java
• check whether tree is Symmetric –
C| C++Java.
• Check for Children-Sum in Binary Tree-
C|C++Java
• Sum of all nodes in Binary Tree-
CC++ | Java
• Lowest Common Ancestor in Binary Tree-
CC++ | Java

### Traversals

• Traversal in Trees
• Tree Traversals: Breadth-First Search (BFS) : C | C++ | Java
• Tree Traversals: Depth First Search (DFS) : C | C++ | Java
• Construct a Binary Tree from Postorder and Inorder

### AVL Trees

• AVL Trees
• AVL Trees: Introduction
• AVL Tree Insertion :  C | C++ | Java
• AVL Tree Deletion : C | C++ | Java
• Insertion in a Binary Tree (Level Order) – C | C++ | Java
• Searching in Binary Tree – C | C++ | Java
• Searching in a Binary Search Tree – C | C++ | Java

### Complete Programs for Trees

• Depth First Traversals – C | C++ | Java
• Level Order Traversal – C | C++Java
• Construct Tree from given Inorder and Preorder traversals – C | C++Java
• Construct Tree from given Postorder and Inorder traversals – C | C++Java
• Construct Tree from given Postorder and Preorder traversal – C | C++Java
• Find size of the Binary tree – C | C++Java
• Find the height of binary tree – C | C++Java
• Find maximum in binary tree – C | C++Java
• Check whether two tree are identical- CC++Java
• Spiral Order traversal of Tree- CC++Java
• Level Order Traversal LIne by Line – C | C++Java
• Hand shaking lemma and some Impotant Tree Properties.
• Check If binary tree if Foldable or not.- CC++Java
• check whether tree is Symmetric  C| C++Java.
• Check for Children-Sum in Binary Tree- C|C++Java
• Sum of all nodes in Binary Tree- CC++ | Java
• Lowest Common Ancestor in Binary Tree. CC++ | Java