Academic Integrity: tutoring, explanations, and feedback — we don’t complete graded work or submit on a student’s behalf.

A Sorted Integer List File IntList.java contains code for an integer list class.

ID: 3546047 • Letter: A

Question

A Sorted Integer List

File IntList.java contains code for an integer list class. Save it to your directory and study it; notice that the only things you can do are to create a list of a fixed size and add an element to a list. If the list is already full, a message will be printed.

File ListTest.java contains code for a class that creates an IntList, puts some values in it, and prints it. Save this to your directory and compile and run it to see how it works.

Now modify the add method in IntList.java such that its elements should always be in sorted order from smallest to largest. This means that when an element is inserted into a IntList it should be put into its sorted place, not just at the end of the array. To do this you'll need to do two things when you add a new element:

Explanation / Answer

// An (unsorted) integer list class with a method to add an
// integer to the list and a toString method that returns the contents
// of the list with indices.
//
// ****************************************************************
public class IntList
{
private int[] list;
private int numElements = 0;
//-------------------------------------------------------------
// Constructor -- creates an integer list of a given size.
//-------------------------------------------------------------
public IntList(int size)
{
list = new int[size];
}
//------------------------------------------------------------
// Adds an integer to the list. If the list is full,
// prints a message and does nothing.
//------------------------------------------------------------
public void add(int value)
{
if (numElements == list.length)
System.out.println("Can't add, list is full");
else
{
// list[numElements] = value;
// numElements++;
int index_to_insert = numElements++;
while((index_to_insert>0) && (list[index_to_insert-1]>value))
{
list[index_to_insert] = list[index_to_insert-1];
index_to_insert--;
}
list[index_to_insert] = value;
}
}

//-------------------------------------------------------------
// Returns a string containing the elements of the list with their
// indices.
//-------------------------------------------------------------
public String toString()
{
String returnString = "";
for (int i=0; i<numElements; i++)
returnString += i + ": " + list[i] + " ";
return returnString;
}
}

// ***************************************************************
// ListTest.java
//
// A simple test program that creates an IntList, puts some
// ints in it, and prints the list.
//
// ***************************************************************
import java.util.Scanner;

public class ListTest
{
public static void main(String[] args)
{
Scanner scan = new Scanner(System.in);
IntList myList = new IntList(10);
int count = 0;
int num;
while (count < 10)
{
System.out.println("Please enter a number, enter 0 to quit:");
num = scan.nextInt();
if(num !=0)
{ myList.add(num);
count++;
}
else break;
}
System.out.println(myList);
}
}

Hire Me For All Your Tutoring Needs
Integrity-first tutoring: clear explanations, guidance, and feedback.
Drop an Email at
drjack9650@gmail.com
Chat Now And Get Quote