Split the array and add the first part to the end | Set 2

Java Program to Move all zeroes to end of array | Set-2 (Using single traversal)

Java Program for Check if an array is sorted and rotated

Java Program to Print array after it is right rotated K times

Java Program for Reversal algorithm for right rotation of an array

Java Program to Find maximum value of Sum( i*arr[i]) with only rotations on given array allowed

Java Program to Modify given array to a non-decreasing array by rotation

Java Program for Maximum sum of i*arr[i] among all rotations of a given array

Java Program to Rotate all odd numbers right and all even numbers left in an Array of 1 to N

Java Program to Rearrange array such that arr[i] >= arr[j] if i is even and arr[i]<=arr[j] if i is odd and j < i

Java Program to Maximize count of corresponding same elements in given Arrays by Rotation

Java Program for Block swap algorithm for array rotation

Python3 Program to Split the array and add the first part to the end | Set 2

Java Program to Find element at given index after a number of rotations

Java Program to Print all possible rotations of a given Array

Java Program to Modify a matrix by rotating ith row exactly i times in clockwise direction

Find Mth element after K Right Rotations of an Array

Java Program to Check if all array elements can be converted to pronic numbers by rotating digits

Java Program to Rearrange array elements into alternate even-odd sequence by anticlockwise rotation of digits

Java Program to Split the array and add the first part to the end | Set 2

Last Updated : 24 Jan, 2022

Given an array and split it from a specified position, and move the first part of array add to the end.

Examples:

Input : arr[] = {12, 10, 5, 6, 52, 36}
            k = 2
Output : arr[] = {5, 6, 52, 36, 12, 10}
Explanation : Split from index 2 and first 
part {12, 10} add to the end .

Input : arr[] = {3, 1, 2}
           k = 1
Output : arr[] = {1, 2, 3}
Explanation : Split from index 1 and first
part add to the end.

A O(n*k) solution is discussed here.
This problem can be solved in O(n) time using the reversal algorithm discussed below,
1. Reverse array from 0 to n – 1 (where n is size of the array).
2. Reverse array from 0 to n – k – 1.
3. Reverse array from n – k to n – 1.

Java

// Java program to Split the array and 
// add the first part to the end 
class Geeks 
{ 
      
/* Function to reverse arr[] from index start to end*/
static void rvereseArray(int arr[], int start, int end) 
{ 
    while (start < end) { 
        int temp = arr[start]; 
        arr[start] = arr[end]; 
        arr[end] = temp; 
        start++; 
        end--; 
    } 
} 
  
// Function to print an array 
static void printArray(int arr[], int size) 
{ 
    for (int i = 0; i < size; i++) 
        System.out.print(arr[i] +" "); 
} 
  
/* Function to left rotate arr[] of size n by k */
static void splitArr(int arr[], int k, int n) 
{ 
    rvereseArray(arr, 0, n - 1); 
    rvereseArray(arr, 0, n - k - 1); 
    rvereseArray(arr, n - k, n - 1); 
} 
  
/* Driver program to test above functions */
public static void main(String args[]) 
{ 
    int arr[] = { 12, 10, 5, 6, 52, 36 }; 
    int n = arr.length; 
    int k = 2; 
  
    // Function calling 
    splitArr(arr, k, n); 
    printArray(arr, n); 
  
} 
  
} 
  
// This code is contributed by ankita_saini. 

Output:

5 6 52 36 12 10

Please refer complete article on Split the array and add the first part to the end | Set 2 for more details!

Suggest improvement

Java Program to Rearrange array elements into alternate even-odd sequence by anticlockwise rotation of digits

C++ Program for Maximum difference between groups of size two

Share your thoughts in the comments

Similar Reads

C++ Program to Split the array and add the first part to the end | Set 2

Python3 Program to Split the array and add the first part to the end | Set 2

Php Program to Split the array and add the first part to the end | Set 2

Javascript Program to Split the array and add the first part to the end | Set 2

Java Program to Split the array and add the first part to the end

Split the array and add the first part to the end

Find partitions that maximises sum of count of 0's in left part and count of 1's in right part

Split the number into N parts such that difference between the smallest and the largest part is minimum

Why start + (end - start)/2 is preferable method for calculating middle of an array over (start + end)/2 ?

Last element of an array after repeatedly removing the first element and appending it to the end of the array twice exactly K times

GeeksforGeeks

Article Tags :

Practice Tags :