Radix sort help needed

Question

Can someone please help me with this radix sort on a dictionary (linkedList from the java utils). I am trying to pass the linkedList into an array which the java apis say that you can do with the to.Array() method but I am getting the noninformative cannot resolve symbol. Like the theory here is that one I should be able to pass a linkedList into an array and two, that I should be able to sort the list by calling the substrings(1,MAX_LENGTH) and then do a minus one on the length for the recursive call. However, this is giving me fits at this point and I don't know if I am totally off track and this will never work or if I am just not thinking it through clearly.
Any help at all would be appreciated greatly...
import java.util.*;
public class radixSort
  //  radix sort using linked lists, where radixSort is not
  //  a method of the LinkeList class.
   public void radixSort(LinkedList listA)
   //*******************this is the line that's giving me fits***********************/
   java.util.LinkedList[] objArray = listA.toArray();
   final int MAX_LENGTH  =  8;    //  Strings are no more than 8 characters
   final int RADIX_SIZE = 26;    //  Alphabet has 26 letters
   // Use an array of 26 ArrayLists to groups the elements of the array
   createQueue[] groups = new createQueue[RADIX_SIZE];
   for (int x = 0; x < MAX_LENGTH; x++)
             for (int i; i < MAX_LENGTH; i++)
             groups = new createQueue();
          for (int position=MAX_LENGTH; position < 0; position--)
for (int scan=0; scan < MAX_LENGTH; scan++)
//ListIterator iter1 = listA.listIterator();
String temp = String.valueOf (listA[scan]);
String letter = temp.substring(0, position);
groups[letter].enqueue ((listA[scan]));
// gather numbers back into list
int num = 0;
for(int d=0; d<MAX_LENGTH; d++)
while (!(groups[d].isEmpty()))
numObj = groups[d].dequeue();
listA[num] = numObj.intValue();
num++;
//****************************Here is the createQueue class...***********************/
public class createQueue
* Construct the queue.
public createQueue( )
front = back = null;
* Test if the queue is logically empty.
* @return true if empty, false otherwise.
public boolean isEmpty( )
return front == null;
* Insert a new item into the queue.
* @param x the item to insert.
public void enqueue( Object x )
if( isEmpty( ) ) // Make queue of one element
back = front = new ListNode( x );
else // Regular case
back = back.next = new ListNode( x );
* Return and remove the least recently inserted item
* from the queue.
public Object dequeue( )
if( isEmpty( ) )
//throw new UnderflowException( "ListQueue dequeue" );
          System.out.println("No elements");
else;
Object returnValue = front;
front = front.next;
return returnValue;
* Get the least recently inserted item in the queue.
* Does not alter the queue.
public Object getFront( )
if( isEmpty( ) )
System.out.println("No elements");
else;
return front;
* Make the queue logically empty.
public void makeEmpty( )
front = null;
back = null;
private ListNode front;
private ListNode back;
private void printans()
     if (isEmpty())
     System.out.println("No elements");
     else
     while (back != front)
     System.out.println (front);
     //front++;

Answer 1

java.util.LinkedList[] objArray = listA.toArray();Impossible! You are going to convert a LinkedList to an array of LinkedList. It's impossible! Or, sheer nonsense, if ever possible.