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!
}
- JAVA PROGRAM SELECTION SORT USING RECURSION - aaaaaaaa, Sunday, November 23, 2008 at 10:12pm
aaaaaaaaaa
- JAVA PROGRAM SELECTION SORT USING RECURSION - Anonymous, Monday, November 24, 2008 at 10:48pm
wOw
Answer this Question
Related Questions
programming - I am having trouble writing this program for java. can anybody ...
Java - I am trying to write an algorithm for my JAVA class and am having some ...
programming - Having troube with java, i am not a regular programmer, if anybody...
JAVA PROGRAMMING - "POWERS" Compute the power of a number given the ...
Java - Can anybody help me figure how to post a Java file to as an attachment. I...
java - Write a java application that finds the smallest of several integers. ...
JAVA - simple java program to retrive data from oracle database between specific...
Java - create a java program that accepts students names, and test scores from a...
Computers (Java) - Hello -- Looking for help with an extra credit assignment to ...
Computers (Java) - Hello -- Looking for help with an extra credit assignment to ...
For Further Reading