Split the array and add the first part to the end
Last Updated :
17 Oct, 2022
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
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
// CPP program to split array and move first
// part to end.
#include <stdio.h>
void splitArr(int arr[], int n, int k)
{
for (int i = 0; i < k; i++) {
// Rotate array by 1.
int x = arr[0];
for (int j = 0; j < n - 1; ++j)
arr[j] = arr[j + 1];
arr[n - 1] = x;
}
}
// Driver code
int main()
{
int arr[] = { 12, 10, 5, 6, 52, 36 };
int n = sizeof(arr) / sizeof(arr[0]);
int position = 2;
splitArr(arr, n, position);
for (int i = 0; i < n; ++i)
printf("%d ", arr[i]);
return 0;
}
// CPP program to split array and move first
// part to end.
#include <iostream>
using namespace std;
void splitArr(int arr[], int n, int k)
{
for (int i = 0; i < k; i++) {
// Rotate array by 1.
int x = arr[0];
for (int j = 0; j < n - 1; ++j)
arr[j] = arr[j + 1];
arr[n - 1] = x;
}
}
// Driver code
int main()
{
int arr[] = { 12, 10, 5, 6, 52, 36 };
int n = sizeof(arr) / sizeof(arr[0]);
int position = 2;
splitArr(arr, n, position);
for (int i = 0; i < n; ++i)
cout <<" "<< arr[i];
return 0;
}
// This code is contributed by shivanisinghss2110
// Java program to split array and move first
// part to end.
import java.util.*;
import java.lang.*;
class GFG {
public static void splitArr(int arr[], int n, int k)
{
for (int i = 0; i < k; i++) {
// Rotate array by 1.
int x = arr[0];
for (int j = 0; j < n - 1; ++j)
arr[j] = arr[j + 1];
arr[n - 1] = x;
}
}
// Driver code
public static void main(String[] args)
{
int arr[] = { 12, 10, 5, 6, 52, 36 };
int n = arr.length;
int position = 2;
splitArr(arr, n, position);
for (int i = 0; i < n; ++i)
System.out.print(arr[i] + " ");
}
}
// Code Contributed by Mohit Gupta_OMG <(0_o)>
# Python program to split array and move first
# part to end.
def splitArr(arr, n, k):
for i in range(0, k):
x = arr[0]
for j in range(0, n-1):
arr[j] = arr[j + 1]
arr[n-1] = x
# main
arr = [12, 10, 5, 6, 52, 36]
n = len(arr)
position = 2
splitArr(arr, n, position)
for i in range(0, n):
print(arr[i], end = ' ')
# Code Contributed by Mohit Gupta_OMG <(0_o)>
// C# program to split array
// and move first part to end.
using System;
class GFG {
// Function to split array and
// move first part to end
public static void splitArr(int[] arr, int n,
int k)
{
for (int i = 0; i < k; i++)
{
// Rotate array by 1.
int x = arr[0];
for (int j = 0; j < n - 1; ++j)
arr[j] = arr[j + 1];
arr[n - 1] = x;
}
}
// Driver code
public static void Main()
{
int[] arr = {12, 10, 5, 6, 52, 36};
int n = arr.Length;
int position = 2;
splitArr(arr, n, position);
for (int i = 0; i < n; ++i)
Console.Write(arr[i] + " ");
}
}
// This code is contributed by Shrikant13.
<?php
// PHP program to split array
// and move first part to end.
function splitArr(&$arr, $n, $k)
{
for ($i = 0; $i < $k; $i++)
{
// Rotate array by 1.
$x = $arr[0];
for ($j = 0; $j < $n - 1; ++$j)
$arr[$j] = $arr[$j + 1];
$arr[$n - 1] = $x;
}
}
// Driver code
$arr = array(12, 10, 5, 6, 52, 36);
$n = sizeof($arr);
$position = 2;
splitArr($arr, n, $position);
for ($i = 0; $i < $n; ++$i)
echo $arr[$i]." ";
// This code is contributed
// by ChitraNayal
?>
<script>
// JavaScript program to split
// array and move first
// part to end.
function splitArr(arr, n, k){
for (let i = 0; i < k; i++)
{
// Rotate array by 1.
let x = arr[0];
for (let j = 0; j < n - 1; ++j)
arr[j] = arr[j + 1];
arr[n - 1] = x;
}
}
// Driver code
let arr = [ 12, 10, 5, 6, 52, 36 ];
let n = arr.length;
let position = 2;
splitArr(arr, n, position);
for (let i = 0; i < n; ++i)
document.write(arr[i]+" ");
</script>
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++
// CPP program to split array and move first
// part to end.
#include <bits/stdc++.h>
using namespace std;
// Function to split array and
// move first part to end
void splitArr(int arr[], int length, int rotation)
{
int tmp[length * 2] = {0};
for(int i = 0; i < length; i++)
{
tmp[i] = arr[i];
tmp[i + length] = arr[i];
}
for(int i = rotation; i < rotation + length; i++)
{
arr[i - rotation] = tmp[i];
}
}
// Driver code
int main()
{
int arr[] = { 12, 10, 5, 6, 52, 36 };
int n = sizeof(arr) / sizeof(arr[0]);
int position = 2;
splitArr(arr, n, position);
for (int i = 0; i < n; ++i)
printf("%d ", arr[i]);
return 0;
}
// This code is contributed by YashKhandelwal8
// Java program to split array and move first
// part to end.
import java.util.*;
import java.lang.*;
class GFG {
// Function to split array and
// move first part to end
public static void SplitAndAdd(int[] A,int length,int rotation){
//make a temporary array with double the size
int[] tmp = new int[length*2];
// copy array element in to new array twice
System.arraycopy(A, 0, tmp, 0, length);
System.arraycopy(A, 0, tmp, length, length);
for(int i=rotation;i<rotation+length;i++)
A[i-rotation]=tmp[i];
}
// Driver code
public static void main(String[] args)
{
int arr[] = { 12, 10, 5, 6, 52, 36 };
int n = arr.length;
int position = 2;
SplitAndAdd(arr, n, position);
for (int i = 0; i < n; ++i)
System.out.print(arr[i] + " ");
}
}
# Python3 program to split array and
# move first part to end.
# Function to split array and
# move first part to end
def SplitAndAdd(A, length, rotation):
# make a temporary array with double
# the size and each index is initialized to 0
tmp = [ 0 for i in range(length * 2)]
# copy array element in to new array twice
for i in range(length):
tmp[i] = A[i]
tmp[i + length] = A[i]
for i in range(rotation,
rotation + length, 1):
A[i - rotation] = tmp[i];
# Driver code
arr = [12, 10, 5, 6, 52, 36]
n = len(arr)
position = 2
SplitAndAdd(arr, n, position);
for i in range(n):
print(arr[i], end = " ")
print()
# This code is contributed by SOUMYA SEN
// C# program to split array
// and move first part to end.
using System;
class GFG
{
// Function to split array and
// move first part to end
public static void SplitAndAdd(int[] A,
int length,
int rotation)
{
// make a temporary array with double the size
int[] tmp = new int[length * 2];
// copy array element in to new array twice
Array.Copy(A, 0, tmp, 0, length);
Array.Copy(A, 0, tmp, length, length);
for (int i = rotation; i < rotation + length; i++)
{
A[i - rotation] = tmp[i];
}
}
// Driver code
public static void Main(string[] args)
{
int[] arr = new int[] {12, 10, 5, 6, 52, 36};
int n = arr.Length;
int position = 2;
SplitAndAdd(arr, n, position);
for (int i = 0; i < n; ++i)
{
Console.Write(arr[i] + " ");
}
}
}
// This code is contributed by kumar65
<script>
// Javascript program to split
// array and move first
// part to end.
// Function to split array and
// move first part to end
function SplitAndAdd(A,Length,rotation)
{
// make a temporary array
// with double the size
let tmp = new Array(Length*2);
for(let i=0;i<tmp.length;i++)
{
tmp[i]=0;
}
// copy array element in to new array twice
for(let i=0;i<Length;i++)
{
tmp[i] = A[i]
tmp[i + Length] = A[i]
}
for(let i=rotation;i<rotation+Length;i++)
{
A[i - rotation] = tmp[i];
}
}
// Driver code
let arr=[12, 10, 5, 6, 52, 36];
let n = arr.length;
let position = 2;
SplitAndAdd(arr, n, position);
for (let i = 0; i < n; ++i)
document.write(arr[i] + " ");
// This code is contributed by avanitrachhadiya2155
</script>
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
Similar Reads
Basics & Prerequisites
Data Structures
Getting Started with Array Data StructureArray is a collection of items of the same variable type that are stored at contiguous memory locations. It is one of the most popular and simple data structures used in programming. Basic terminologies of ArrayArray Index: In an array, elements are identified by their indexes. Array index starts fr
14 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