Minimum steps required to rearrange given array to a power sequence of 2 | Java Program to implement 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
import java . util . * ; import java . lang . Math ; class GFG { static int minsteps ( int arr [ ] , int n ) { Arrays . sort ( arr ) ; int ans = 0 ; for ( int i = 0 ; i < n ; i ++ ) { ans += Math . abs ( arr [ i ] - Math . pow ( 2 , i ) ) ; } return ans ; } public static void main ( String [ ] args ) { int arr [ ] = { 1 , 8 , 2 , 10 , 6 } ; int n = arr . length ; System . out . println ( minsteps ( arr , n ) ) ; } }