Open In App

Split the array and add the first part to the end

Last Updated : 17 Oct, 2022
Comments
Improve
Suggest changes
57 Likes
Like
Report

There is a given array and split it from a specified position, and move the first splitted part of the array and then add to the end of array
 

Split the array and add the first part to the end

Examples: 

Input : arr[] = {12, 10, 5, 6, 52, 36}
            k = 2
Output : arr[] = {5, 6, 52, 36, 12, 10}
Explanation : here k is two so first two elements are splitted and they are added at the end of array

Input : arr[] = {3, 1, 2}
           k = 1
Output : arr[] = {1, 2, 3}
Explanation :here k is one  so first one  element  are splitted and it  is added at the end of array

Simple Solution: We will rotate the elements of the array one by one.

Implementation:

C
C++ Java Python3 C# PHP JavaScript

Output
5 6 52 36 12 10 

Time complexity: O(n*k). 
Space complexity: O(1), since no extra space has been taken.

Another approach: Another approach is to make a temporary array with double the size and copy our array element into a new array twice and then copy the element from the new array to our array by taking the rotation as starting index up to the length of our array.

Below is the implementation of the above approach.

C++
Java Python3 C# JavaScript

Output
5 6 52 36 12 10 

Time complexity: O(n)
Space complexity: O(2*n)

An efficient O(n) solution is discussed in the following post: Split the array and add the first part to the end | Set 2
This problem is noted but array rotation problem and we can apply the optimized O(n) array rotation methods here. 
Program for array rotation 
Block swap algorithm for array rotation
Reversal algorithm for array rotation 
Quickly find multiple left rotations of an array | Set 1 
Print left rotation of array in O(n) time and O(1) space

 


Next Article
Article Tags :
Practice Tags :

Similar Reads