-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathInsertAtAnyPositionInArray.java
More file actions
48 lines (37 loc) · 1.14 KB
/
Copy pathInsertAtAnyPositionInArray.java
File metadata and controls
48 lines (37 loc) · 1.14 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
/*
* Author: Hasnain Memon
* Date: 29/10/2024
*/
// Task : Insert element at any position
public class InsertAtAnyPositionInArray {
static void insertElement(int[] arr, int n, int x, int position) {
//shift elements to the right
//which are on the right side of position
for (int i = n-1; i >= position - 1; i--) {
arr[i + 1] = arr[i];
}
arr[position - 1] = x; //index = position - 1
}
public static void main(String[] args) {
int[] arr = new int[10];
arr[0] = 12;
arr[1] = 16;
arr[2] = 20;
arr[3] = 40;
arr[4] = 50;
arr[5] = 70;
int n = 6;
int x = 30, position = 2;
System.out.println("Before Insertion: ");
for (int i = 0; i < n; i++) {
System.out.print(arr[i] + " ");
}
//Inserting key at specific position
insertElement(arr, n, x, position);
n += 1;
System.out.println("\nAfter Insertion: ");
for (int i = 0; i < n; i++) {
System.out.print(arr[i] + " ");
}
}
}