1. Write a program using JAVA that inputs five numbers, each of which is between 10 and 100, inclusive. As each number is read, display it only if it is not a duplicate of a number already read. Display the complete set of unique values input after the user inputs each new value.

Sample Output: Enter number: 11 11 Enter number: 85 11 85 Enter number: 26 11 26 85 Enter number: 11 11 have already been entered 11 26 85 Enter number: 41 11 26 41 85

by only changing in this code :

Ordered Array: //////////////////////////////////////////////////////////////// public class OrdArray { private long[] a; // ref to array a private int nElems; // number of data items //-----------------------------------------------------------

public OrdArray(int max) // constructor { a = new long[max]; // create array 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; // found it else if(lowerBound > upperBound) return nElems; // can't find it else // divide range { if(a[curIn] < searchKey) lowerBound = curIn + 1; // it's in upper half else upperBound = curIn - 1; // it's in lower half } // end else divide range } // end while } // end find() //----------------------------------------------------------- public void insert(long value) // put element into array { int j; for(j=0; j value) // (linear search) break; for(int k=nElems; k>j; k--) // move bigger ones up a[k] = a[k-1]; a[j] = value; // insert it nElems++; // increment size } // end insert() //----------------------------------------------------------- public boolean delete(long value) { int j = find(value); if(j==nElems) // can't find it return false; else // found it { for(int k=j; k