Rearrange given Array by replacing every element with the element located at mean of adjacent elements
Last Updated :
06 Jun, 2022
Given an array arr[]. The array contains numbers from 0 to N-1 only, where N is the size of arr[]. The task is to modify the array in such that for each i from 0≤i<N, arr[i] = arr[ (arr[i-1] + arr[i+1]) / 2 ]
There are a few exceptions:
- For first element of the array, arr[i-1] = 0; because previous index does not exist.
- For the last element of the array, arr[i+1] = 0; because next index does not exist.
Examples:
Input: arr[]= {3, 2, 1, 4, 1, 8, 6, 8, 7}
Output: [2, 1, 4, 2, 6, 4, 7, 6, 1]
Explanation: Following are the operations performed to reach the desired output.
For index 0, arr[i-1]=0 and arr[i+1]=2, arr[0]= arr[(0+2)/2] = arr[1] = 2
For index 3, arr[i-1]=1 and arr[i+1]=1, arr[3]= arr[(1+1)/2] = arr[1] = 2
Input: arr[]= {2, 5, 3, 4, 0, 1}
Output: [3, 3, 0, 5, 3, 2]
Explanation: Following are the operations performed to reach the desired output.
For index 1, arr[i-1]=2 and arr[i+1]=3, arr[1]= arr[(2+3)/2] = arr[2] = 3
For index 4, arr[i-1]=4 and arr[i+1]=1, arr[4]= arr[(4+1)/2] = arr[2] = 3
Naive Approach: The simplest way is to create a new array and compute the values for each index using the given array, but this will take extra space. For every index, get the values of previous and next indexes and compute their average. This average will be the index whose value has to be copied at the chosen index in the new array. Thus, arr[i] = arr[ (arr[i-1] + arr[i+1]) / 2 ] will be achieved.
Time complexity: O(N), N is the size of arr[].
Auxiliary Space: O(N)
Efficient approach: This approach traverses the same array once and at the end desired array will be found. Keep track of the previous index element, so that even if its value is modified, the old value is possible to calculate. Only O(1) space is used in this case, that for the temporary variable to store the value of the previous element.
How to achieve this?
Consider two numbers x and y, both are less than N. The aim is to update the value of x (x = y) such that the old value (x=x) is not lost. Basically, just hold two values of x in the same variable. For that purpose First, increment the value x by the factor y*N. Updated x becomes x+y*N. The old value of x can be obtained by taking mod of Updated value; (x+y*N % N). The new value of x can be obtained by taking the quotient by dividing by N, (x+y*N/N). Follow the steps below to solve the given problem.
- Iterate the array arr[] from left to right.
- For every index increment the element by arr[(arr[i-1]+arr[i+1])/2] * N.
- To get the previous of ith element find the modulo with N, i.e arr[i-1]%N.
- To get the next of ith element find the quotient with N, i.e. arr[i+1]/N.
- Again Traverse the array from start to end.
- Print the ith element after dividing the ith element by N, i.e. array[i]/N.
Below is the implementation of the above approach.
C++
// Program to modify the given array
// as per given constraint.
#include <iostream>
using namespace std;
// Function to find the previous val
int FindPrev(int i, int a, int n)
{
if (i == 0)
return 0;
else
return a % n;
}
// Function to find the next value
int FindNext(int i, int a, int n)
{
if (i == n - 1)
return 0;
else
return a;
}
// The function to rearrange an array
// in-place so that arr[i] becomes
// arr[(arr[i-1]+arr[i+1])/2].
void ModifyTheArray(int arr[], int n)
{
int new_ind, new_ind_val, next, prev;
// Traverse the array arr[]
for (int i = 0; i < n; i++) {
prev = FindPrev(i, arr[i - 1], n);
next = FindNext(i, arr[i + 1], n);
new_ind = (prev + next) / 2;
new_ind_val = arr[new_ind] % n;
arr[i] = arr[i] + n * new_ind_val;
}
for (int i = 0; i < n; i++)
arr[i] /= n;
}
// A utility function to display the array of size n
void DisplayArray(int arr[], int n)
{
for (int i = 0; i < n; i++)
cout << arr[i] << " ";
cout << endl;
}
// Driver Code
int main()
{
int arr[] = { 3, 2, 1, 4, 1, 8, 6, 8, 7 };
int N = sizeof(arr) / sizeof(arr[0]);
cout << "Given array is=> \n";
DisplayArray(arr, N);
ModifyTheArray(arr, N);
cout << "Modified array is=> \n";
DisplayArray(arr, N);
return 0;
}
// Java Program to modify the given array
// as per given constraint.
import java.util.*;
public class GFG
{
// Function to find the previous val
static int FindPrev(int i, int a, int n)
{
if (i == 0)
return 0;
else
return a % n;
}
// Function to find the next value
static int FindNext(int i, int a, int n)
{
if (i == n - 1)
return 0;
else
return a;
}
// The function to rearrange an array
// in-place so that arr[i] becomes
// arr[(arr[i-1]+arr[i+1])/2].
static void ModifyTheArray(int arr[], int n)
{
int new_ind, new_ind_val, next, prev;
// Traverse the array arr[]
for (int i = 0; i < n; i++) {
if(i - 1 >= 0 ){
prev = FindPrev(i, arr[i - 1], n);
}
else{
prev = 0;
}
if(i + 1 < n){
next = FindNext(i, arr[i + 1], n);
}
else{
next = 0;
}
new_ind = (prev + next) / 2;
new_ind_val = arr[new_ind] % n;
arr[i] = arr[i] + n * new_ind_val;
}
for (int i = 0; i < n; i++)
arr[i] /= n;
}
// A utility function to display the array of size n
static void DisplayArray(int arr[], int n)
{
for (int i = 0; i < n; i++)
System.out.print(arr[i] + " ");
System.out.println();
}
// Driver code
public static void main(String args[])
{
int arr[] = { 3, 2, 1, 4, 1, 8, 6, 8, 7 };
int N = arr.length;
System.out.println("Given array is=>");
DisplayArray(arr, N);
ModifyTheArray(arr, N);
System.out.println("Modified array is=>");
DisplayArray(arr, N);
}
}
// This code is contributed by Samim Hossain Mondal.
# python3 Program to modify the given array
# as per given constraint.
# Function to find the previous val
def FindPrev(i, a, n):
if (i == 0):
return 0
else:
return a % n
# Function to find the next value
def FindNext(i, a, n):
if (i == n - 1):
return 0
else:
return a
# The function to rearrange an array
# in-place so that arr[i] becomes
# arr[(arr[i-1]+arr[i+1])/2].
def ModifyTheArray(arr, n):
# Traverse the array arr[]
for i in range(0, n):
prev = FindPrev(i, arr[i - 1], n)
next = FindNext(i, arr[i + 1], n) if i + 1 < n else 0
new_ind = (prev + next) // 2
new_ind_val = arr[new_ind] % n
arr[i] = arr[i] + n * new_ind_val
for i in range(0, n):
arr[i] //= n
# A utility function to display the array of size n
def DisplayArray(arr, n):
for i in range(0, n):
print(arr[i], end=" ")
print()
# Driver Code
if __name__ == "__main__":
arr = [3, 2, 1, 4, 1, 8, 6, 8, 7]
N = len(arr)
print("Given array is=> ")
DisplayArray(arr, N)
ModifyTheArray(arr, N)
print("Modified array is=> ")
DisplayArray(arr, N)
# This code is contributed by rakeshsahni
// C# program for the above approach
using System;
using System.Collections;
class GFG
{
// Function to find the previous val
static int FindPrev(int i, int a, int n)
{
if (i == 0)
return 0;
else
return a % n;
}
// Function to find the next value
static int FindNext(int i, int a, int n)
{
if (i == n - 1)
return 0;
else
return a;
}
// The function to rearrange an array
// in-place so that arr[i] becomes
// arr[(arr[i-1]+arr[i+1])/2].
static void ModifyTheArray(int []arr, int n)
{
int new_ind, new_ind_val, next, prev;
// Traverse the array arr[]
for (int i = 0; i < n; i++) {
if(i - 1 >= 0 ){
prev = FindPrev(i, arr[i - 1], n);
}
else{
prev = 0;
}
if(i + 1 < n){
next = FindNext(i, arr[i + 1], n);
}
else{
next = 0;
}
new_ind = (prev + next) / 2;
new_ind_val = arr[new_ind] % n;
arr[i] = arr[i] + n * new_ind_val;
}
for (int i = 0; i < n; i++)
arr[i] /= n;
}
// A utility function to display the array of size n
static void DisplayArray(int []arr, int n)
{
for (int i = 0; i < n; i++)
Console.Write(arr[i] + " ");
Console.WriteLine();
}
// Driver code
public static void Main()
{
int []arr = { 3, 2, 1, 4, 1, 8, 6, 8, 7 };
int N = arr.Length;
Console.WriteLine("Given array is=>");
DisplayArray(arr, N);
ModifyTheArray(arr, N);
Console.WriteLine("Modified array is=>");
DisplayArray(arr, N);
}
}
// This code is contributed by Samim Hossain Mondal.
<script>
// JavaScript program to modify the given array
// as per given constraint.
// Function to find the previous val
function FindPrev(i, a, n)
{
if (i == 0)
return 0;
else
return a % n;
}
// Function to find the next value
function FindNext(i, a, n)
{
if (i == n - 1)
return 0;
else
return a;
}
// The function to rearrange an array
// in-place so that arr[i] becomes
// arr[(arr[i-1]+arr[i+1])/2].
function ModifyTheArray(arr, n)
{
let new_ind, new_ind_val, next, prev;
// Traverse the array arr[]
for(let i = 0; i < n; i++)
{
prev = FindPrev(i, arr[i - 1], n);
next = FindNext(i, arr[i + 1], n);
new_ind = Math.floor((prev + next) / 2);
new_ind_val = arr[new_ind] % n;
arr[i] = arr[i] + n * new_ind_val;
}
for(let i = 0; i < n; i++)
arr[i] = Math.floor(arr[i] / n);
}
// A utility function to display the array of size n
function DisplayArray(arr, n)
{
for(let i = 0; i < n; i++)
document.write(arr[i] + " ")
document.write('<br')
}
// Driver Code
let arr = [ 3, 2, 1, 4, 1, 8, 6, 8, 7 ];
let N = arr.length;
document.write("Given array is=> " + "<br>");
DisplayArray(arr, N);
ModifyTheArray(arr, N);
document.write("Modified array is=> " + "<br>");
DisplayArray(arr, N);
// This code is contributed by Potta Lokesh
</script>
OutputGiven array is=>
3 2 1 4 1 8 6 8 7
Modified array is=>
2 1 4 2 6 4 7 6 1
Time Complexity: O(N), where N is the size of arr[] as we are using a loop to traverse N times.
Auxiliary Space: O(1), as we are not using any extra space.
Similar Reads
Basics & Prerequisites
Data Structures
Array Data StructureIn this article, we introduce array, implementation in different popular languages, its basic operations and commonly seen problems / interview questions. An array stores items (in case of C/C++ and Java Primitive Arrays) or their references (in case of Python, JS, Java Non-Primitive) at contiguous
3 min read
String in Data StructureA string is a sequence of characters. The following facts make string an interesting data structure.Small set of elements. Unlike normal array, strings typically have smaller set of items. For example, lowercase English alphabet has only 26 characters. ASCII has only 256 characters.Strings are immut
2 min read
Hashing in Data StructureHashing is a technique used in data structures that efficiently stores and retrieves data in a way that allows for quick access. Hashing involves mapping data to a specific index in a hash table (an array of items) using a hash function. It enables fast retrieval of information based on its key. The
2 min read
Linked List Data StructureA linked list is a fundamental data structure in computer science. It mainly allows efficient insertion and deletion operations compared to arrays. Like arrays, it is also used to implement other data structures like stack, queue and deque. Here’s the comparison of Linked List vs Arrays Linked List:
2 min read
Stack Data StructureA Stack is a linear data structure that follows a particular order in which the operations are performed. The order may be LIFO(Last In First Out) or FILO(First In Last Out). LIFO implies that the element that is inserted last, comes out first and FILO implies that the element that is inserted first
2 min read
Queue Data StructureA Queue Data Structure is a fundamental concept in computer science used for storing and managing data in a specific order. It follows the principle of "First in, First out" (FIFO), where the first element added to the queue is the first one to be removed. It is used as a buffer in computer systems
2 min read
Tree Data StructureTree Data Structure is a non-linear data structure in which a collection of elements known as nodes are connected to each other via edges such that there exists exactly one path between any two nodes. Types of TreeBinary Tree : Every node has at most two childrenTernary Tree : Every node has at most
4 min read
Graph Data StructureGraph Data Structure is a collection of nodes connected by edges. It's used to represent relationships between different entities. If you are looking for topic-wise list of problems on different topics like DFS, BFS, Topological Sort, Shortest Path, etc., please refer to Graph Algorithms. Basics of
3 min read
Trie Data StructureThe Trie data structure is a tree-like structure used for storing a dynamic set of strings. It allows for efficient retrieval and storage of keys, making it highly effective in handling large datasets. Trie supports operations such as insertion, search, deletion of keys, and prefix searches. In this
15+ min read
Algorithms
Searching AlgorithmsSearching algorithms are essential tools in computer science used to locate specific items within a collection of data. In this tutorial, we are mainly going to focus upon searching in an array. When we search an item in an array, there are two most common algorithms used based on the type of input
2 min read
Sorting AlgorithmsA Sorting Algorithm is used to rearrange a given array or list of elements in an order. For example, a given array [10, 20, 5, 2] becomes [2, 5, 10, 20] after sorting in increasing order and becomes [20, 10, 5, 2] after sorting in decreasing order. There exist different sorting algorithms for differ
3 min read
Introduction to RecursionThe process in which a function calls itself directly or indirectly is called recursion and the corresponding function is called a recursive function. A recursive algorithm takes one step toward solution and then recursively call itself to further move. The algorithm stops once we reach the solution
14 min read
Greedy AlgorithmsGreedy algorithms are a class of algorithms that make locally optimal choices at each step with the hope of finding a global optimum solution. At every step of the algorithm, we make a choice that looks the best at the moment. To make the choice, we sometimes sort the array so that we can always get
3 min read
Graph AlgorithmsGraph is a non-linear data structure like tree data structure. The limitation of tree is, it can only represent hierarchical data. For situations where nodes or vertices are randomly connected with each other other, we use Graph. Example situations where we use graph data structure are, a social net
3 min read
Dynamic Programming or DPDynamic Programming is an algorithmic technique with the following properties.It is mainly an optimization over plain recursion. Wherever we see a recursive solution that has repeated calls for the same inputs, we can optimize it using Dynamic Programming. The idea is to simply store the results of
3 min read
Bitwise AlgorithmsBitwise algorithms in Data Structures and Algorithms (DSA) involve manipulating individual bits of binary representations of numbers to perform operations efficiently. These algorithms utilize bitwise operators like AND, OR, XOR, NOT, Left Shift, and Right Shift.BasicsIntroduction to Bitwise Algorit
4 min read
Advanced
Segment TreeSegment Tree is a data structure that allows efficient querying and updating of intervals or segments of an array. It is particularly useful for problems involving range queries, such as finding the sum, minimum, maximum, or any other operation over a specific range of elements in an array. The tree
3 min read
Pattern SearchingPattern searching algorithms are essential tools in computer science and data processing. These algorithms are designed to efficiently find a particular pattern within a larger set of data. Patten SearchingImportant Pattern Searching Algorithms:Naive String Matching : A Simple Algorithm that works i
2 min read
GeometryGeometry is a branch of mathematics that studies the properties, measurements, and relationships of points, lines, angles, surfaces, and solids. From basic lines and angles to complex structures, it helps us understand the world around us.Geometry for Students and BeginnersThis section covers key br
2 min read
Interview Preparation
Practice Problem