Minimum steps required to rearrange given array to a power sequence of 2 | C # Program to the above approach ; Function to calculate the minimum steps required to convert given array into a power sequence of 2 ; Sort the array in ascending order ; Calculate the absolute difference between arr [ i ] and 2 ^ i for each index ; Return the answer ; Driver Code
using System ; class GFG { static int minsteps ( int [ ] arr , int n ) { Array . Sort ( arr ) ; int ans = 0 ; for ( int i = 0 ; i < n ; i ++ ) { ans += Math . Abs ( arr [ i ] - ( int ) ( Math . Pow ( 2 , i ) ) ) ; } return ans ; } public static void Main ( ) { int [ ] arr = { 1 , 8 , 2 , 10 , 6 } ; int n = arr . Length ; Console . WriteLine ( minsteps ( arr , n ) ) ; } }