Program to insert, search for and delete an element from an array
The easy stuff first...

You should format your code nicer. It makes it easier to read for everyone who uses the same standard formatting style. Use your IDE's reformatting function (Control + Shift + f in Eclipse, Alt + Control + l in IntelliJ) to reformat before posting on forums.

Remove pointless comments. The auto-generated TODO has no place in working code. And this one for example is really stating the obvious:


// array initialization
int[] arr = { 5, 10, 12, 22, 4 };



In general, try to not write comments. If your code is not self-explanatory without comments, try to rewrite it. A common technique is to extract a few lines of code into a method, and the name of the method will explain what those lines do instead of a comment.

You probably you know you're reinventing the wheel, but just for the record, there is an ArrayList&lt;T&gt; class that can do all the things you're doing in your code.

Object-oriented design

The code in the main method is doing all kinds of things, all of them centered around an array, and various manipulations on it, such as:


find the index of an element
remove an element, if exists
print elements


It would make sense to encapsulate all these by a class to keep track of the array and its size. Maybe something like this:

public class ArraysDemo {

    private final int[] values;
    private int size;

    public ArraysDemo(int... values) {
        this.values = values.clone();
        this.size = values.length;
    }

    int indexOf(int value) {
        for (int i = 0; i &lt; size; i++) {
            if (values[i] == value) {
                return i;
            }
        }
        return -1;
    }

    boolean remove(int value) {
        for (int i = 0; i &lt; size; i++) {
            if (values[i] == value) {
                --size;
                for (; i &lt; size; ++i) {
                    values[i] = values[i + 1];
                }
                return true;
            }
        }
        return false;
    }

    void print() {
        System.out.print("Elements in the array: ");
        for (int i = 0; i &lt; size; ++i) {
            System.out.print(values[i] + " ");
        }
        System.out.println();
    }
}


I tried to mimic the methods in ArrayList&lt;T&gt;. This is a good idea to do when you're reinventing the wheel. For example indexOf to find the index of an element, or return -1 if not found. A remove method that returns true if something was removed.

Using this class, you can rewrite the main method like this:

ArraysDemo arr = new ArraysDemo(5, 10, 12, 22, 4);
arr.print();

int index = arr.indexOf(11);
if (index &lt; 0) {
    System.out.println("Element not found");
} else {
    System.out.println("Element found in the position " + index);
}

if (!arr.remove(5)) {
    System.out.println("Element not found");
}
arr.print();


As a final step, the class can be generalized to work with any type, not only integers. When you do that, remember to change all the conditions with == to use the .equals method instead, for example:

public class ArraysDemo&lt;T&gt; {

    private final T[] values;
    private int size;

    // ...

    int indexOf(int value) {
        for (int i = 0; i &lt; size; i++) {
            if (values[i].equals(value)) {
                return i;
            }
        }
        return -1;
    }
}