Advertisement
Samuel_Berkat_Hulu

HighArray

Mar 29th, 2021
97
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
Java 1.21 KB | None | 0 0
  1. class HighArray
  2.  
  3. {
  4.  private long[] a; // ref to array a
  5.  private int nElems; // number of data items
  6.  public HighArray(int max) // constructor
  7.  
  8. {
  9.  a = new long[max]; // create the array
  10.  nElems = 0; // no items yet
  11.  
  12. }
  13.  public boolean find(long searchKey)
  14.  { // find specified value
  15.  int j;
  16.  for(j=0; j<nElems; j++) // for each element,
  17.  if(a[j] == searchKey) // found item?
  18.  break; // exit loop before end
  19.  if(j == nElems) // gone to end?
  20.  return false; // yes, can't find it
  21.  else
  22.  return true; // no, found it
  23.  } // end find()
  24.  public void insert(long value) // put element into array
  25.  
  26. {
  27.  a[nElems] = value; // insert it
  28.  nElems++; // increment size
  29.  
  30. }
  31.  public boolean delete(long value)
  32.  
  33. {
  34.  int j;
  35.  for(j=0; j<nElems; j++) // look for it
  36.  if( value == a[j] )
  37.  break;
  38.  if(j==nElems) // can't find it
  39.  return false;
  40.  else // found it
  41.  
  42. {
  43.  for(int k=j; k<nElems; k++) // move higher ones down
  44.  a[k] = a[k+1];
  45.  nElems--; // decrement size
  46.  return true;
  47.  
  48. }
  49.  } // end delete()
  50.  public void display() // displays array contents
  51.  
  52. {
  53.  for(int j=0; j<nElems; j++) // for each element,
  54.  System.out.print(a[j] + " "); // display it
  55.  System.out.println("");
  56.  }
  57.  } // end class HighArray
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement