Scribd
Upload
28 views3 pages

Java Array Operations Explained

The document contains a Java class named ArrOperation that demonstrates basic array operations such as traversing, inserting, deleting, searching, and updating elements in an array. It includes methods for each operation and showcases their usage in the main method with an example array. The program outputs the results of each operation to the console.

Uploaded by

Kristyl Jea Responte
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
28 views3 pages

Java Array Operations Explained

The document contains a Java class named ArrOperation that demonstrates basic array operations such as traversing, inserting, deleting, searching, and updating elements in an array. It includes methods for each operation and showcases their usage in the main method with an example array. The program outputs the results of each operation to the console.

Uploaded by

Kristyl Jea Responte
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd

public class ArrOperation {

public static void main(String[] args) {

int[] array = {1, 2, 3, 4, 5};

// 1. Traverse an array

[Link]("Traversing array:");

traverseArray(array);

// 2. Insert an element at a specific position

int newArray[] = insertElement(array, 2, 10);

[Link]("Array after inserting 10 at position 2:");

traverseArray(newArray);

// 3. Delete an element at a specific position

int deletedArray[] = deleteElement(newArray, 2);

[Link]("Array after deleting element at position 2:");

traverseArray(deletedArray);

// 4. Search for an element

int searchElement = 4;

int searchResult = searchArray(deletedArray, searchElement);

if (searchResult != -1) {

[Link]("Element " + searchElement + " found at position " + searchResult);

} else {

[Link]("Element " + searchElement + " not found");

// 5. Update an element at a specific position

updateElement(deletedArray, 1, 20);
[Link]("Array after updating element at position 1:");

traverseArray(deletedArray);

public static void traverseArray(int[] array) {

for (int i = 0; i < [Link]; i++) {

[Link](array[i] + " ");

[Link]();

public static int[] insertElement(int[] array, int position, int element) {

int newArray[] = new int[[Link] + 1];

for (int i = 0; i < position; i++) {

newArray[i] = array[i];

newArray[position] = element;

for (int i = position; i < [Link]; i++) {

newArray[i + 1] = array[i];

return newArray;

public static int[] deleteElement(int[] array, int position) {

int newArray[] = new int[[Link] - 1];

for (int i = 0; i < position; i++) {

newArray[i] = array[i];

for (int i = position; i < [Link] - 1; i++) {


newArray[i] = array[i + 1];

return newArray;

public static int searchArray(int[] array, int element) {

for (int i = 0; i < [Link]; i++) {

if (array[i] == element) {

return i;

return -1;

public static void updateElement(int[] array, int position, int element) {

array[position] = element;

You might also like