Laboratory Exercise:

1.Write a main class for this class that will demonstrate array using ordered algorithm, using insert, delete and display methods.

Note: Include all the necessary error-checking for this program.

The program should have the following menu:

Menu

[1] Insert value

[2] Display arrays values

[3] Delete a value

[4] Exit

Enter your choice:

public class OrdArray {

private long [] a;

private int nElems;

public OrdArray(int max)

{

a= new long[max];

nElems = 0;

}

public int size (){ return nElems;

}

public int find( long searchKey)

{

int lowerBound = 0;

int upperBound = nElems-1;

int curIn;

while(true)

{

curIn = (lowerBound + upperBound ) / 2;

if (a[curIn] == searchKey)

return curIn;

else if (lowerBound > upperBound)

return nElems;

else

{

if(a[curIn] < searchKey)

lowerBound = curIn+1;

else

upperBound = curIn-1;

}

}

}

public void insert(long value)

{

int j;

for(j=0; j

if (a[j] > value )

break;

for ( int k = nElems; k>j; k--)

a[k] = a[k-1];

a[j] = value;

nElems++;

}

public boolean delete (long value)

{

int j = find (value);

if(j==nElems)

return false;

else

{

for(int k=j; k

a[k] = a[k+1];

nElems--;

return true;

}

}

public void display()

{

for(int j=0; j

System.out.print(a[j]+ " ");

System.out.println("");

}

}