Monday
April 27, 2015

Homework Help: JAVA PROGRAM SELECTION SORT USING RECURSION

Posted by Cuchi on Saturday, September 27, 2008 at 2:03am.

JAVA PROGRAM Details:
I'm having a trouble with the print lines, i'm not sure where to start but i think I got the rest down correctly. Please if there is a mistake in this program, let me know or correct my current program below, this program should be compiled in JGRASP OR BLUEJ please try it to compile yourself too.

Thanksthe sort() method calls sortSublist(0,length-1) * * Write a DRIVER with a main() method to test your sorting algorithm. * It should do the following: * * 1. Generate a list of 50 random integers. * 2. Print out the unsorted list (with 5 integers per line). * 3. Sort the list. * 4. Print out the sorted list. * ***************************************************************************/ class SortableIntegerList { private int maxLength, // The length of the array length; // The length of the list (length <= maxLength) private int[] a; // An array with the integers in the list public SortableIntegerList (int mxLen) // Creates an empty list with maximum length mxLen { maxLength = mxLen; length = 0; a = new int[maxLength]; }




Optional Information:
Level: 2nd; Subject: Computer Science/Data Structure and Algorithm

Already Tried:
class SortableIntegerList
{
private int maxLength, // The length of the array
length; // The length of the list (length <= maxLength)
private int[] a; // An array with the integers in the list

public SortableIntegerList (int mxLen)
// Creates an empty list with maximum length mxLen
{
maxLength = mxLen;
length = 0;
a = new int[maxLength];
}

public void append (int value)
// Append the value to the end of the list
{
a[length] = value;
length++;
}

public void sort()
// Sort the list from smallest to largest
{
sortSublist(0,length-1);
}

private void sortSublist(int startIndex, int endIndex)
// Sort the sublist a[startIndex]...a[endIndex]
// IMPORTANT: This method must be recursive!
{
// YOUR CODE GOES HERE!
if ( endIndex >= startIndex.length -1 )
return;
int minIndex = endIndex;
for ( int index = endIndex + 1; index < startIndex.length; index++ )
{
if (startIndex[index] < startIndex[minIndex] )
minIndex = index;
}
int temp = startIndex[endIndex];
startIndex[endIndex] = startIndex[minIndex];
startIndex[minIndex] = temp;
sortSublist(startIndex, endIndex +1);
}

}

public void printList ()
/* Prints the values in the list to standard output with
five values per line, properly aligned in columns
*/
{
// YOUR CODE GOES HERE!


}

Answer this Question

First Name:
School Subject:
Answer:

Related Questions

Members