To the HighArray class in the highArray.java, add a method called getMax() that returns the value of the highest key in the array, or 01 if the array is empty. Add some code in main() to exercise this method. You can assume all the keys are positive numbers. class HighArrayprivate long [] a; // zef to array aprivate int nElems; // number of data items//---public HighArray (int max) // constructora = new long (max]; // create the arraynElems = 0; // no items yet//--public boolean find (long searchkey){ // find specified valueint j;for (j=0; j System.out.println ("Found "+ searchkey);elseSystem. out.printin ("Can't find " + searchkey);arr.delete (00); // delete 3 itemsarr.delete (55);arr.delete (99);arr.display (); // display items again} // end main()} // end class HighArrayApp

Algorithm: Start Implement a method named getMax() inside the HighArray class Inside the method, if…

Answered: To the HighArray class in the…

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Question

To the HighArray class in the highArray.java, add a method called getMax() that returns the value of the highest key in the array, or 01 if the array is empty. Add some code in main() to exercise this method. You can assume all the keys are positive numbers.

class HighArray
private long [] a; // zef to array a
private int nElems; // number of data items
//---
public HighArray (int max) // constructor
a = new long (max]; // create the array
nElems = 0; // no items yet
//--
public boolean find (long searchkey)
{ // find specified value
int j;
for (j=0; j<nElems; j++) // for each element,
if (alj] == searchkey) // found item?
break; // exit loop before end
if (j == nElems) // gone to end?
return false; // yes, can't find it
else
return true; // no, found it
} // end find ()
/-
public void insert (long value) // put element into array
a [nElems] = value; // insert it
nElems++;// incremment sise
//
public boolean delete (1long value)
int j;
for (j=0; jenElems; j++) // look for it
if ( value = alj))
break;
if (j==nElems) // can't find it
return false;
else // found it
for (int k=j; k<nElems; k++) // move higher ones doem
a[k] = a[k+1];
nElems--; // decrement sise
return true;
} // end delete ()
//---
public void display () // displays array contents
for (int j=0; j<nElems; j++) // for each element,
System.out.print (a(j) + "); // display it
System.out.println ("");
/-
} // end class HighArray
public class HighArrayApp{
public statie void main (String(] args) {
int max3ize = 100; // array size
HighArray arr; // reference to array
arr = rew HighArray (max3ise); // create the array
arz.insert (77); // insert 10 items
arz.insert (99);
arz.insert (44);
arz.insert (55);
.insert (22) ;
arz.insert (08);
arz.insert (11);
arr.insert (00) ;
arr.insert (66);
arr.insert (33);
azz.display); // display items
int searchkey = 35; // search for item
if( arr.find (searchKey))

System.out.println ("Found "
+ searchkey);
else
System. out.printin ("Can't find " + searchkey);
arr.delete (00); // delete 3 items
arr.delete (55);
arr.delete (99);
arr.display (); // display items again
} // end main()
} // end class HighArrayApp

Expert Solution

Trending now

This is a popular solution!

Step by step

Solved in 4 steps with 2 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions