因此,我的医生让我执行treeSort(),然后在int [1000000]上测试它并计算时间。执行treeSort问题()
我有类BSTree<E>
它包含以下方法:
public void treeSort(E[] data)
{
inorder(data, new Process<E>(), root);
}
public static <E> void inorder(E[] list, Process<E> proc, BTNode<E> p)
{
if (p != null)
{
inorder(list, proc, p.getLeft()); // Traverse its left subtree
proc.append(list, p.getElement()); // Process the node
inorder(list, proc, p.getRight()); // Traverse its right subtree
}
}
,我有Process<E>
类:
public class Process<E>
{
private int counter = 0;
public void append(E[] list, E element)
{
list[counter] = element;
counter++;
}
}
,我有以下Main
类:
public class Main
{
public static void main(String[] args)
{
int[] temp = {4,2,6,4,5,2,9,7,11,0,-1,4,-5};
treeSort(temp);
for(int s : temp) System.out.println(s);
}
public static void treeSort(int[] data)
{
BSTree<Integer> tree = new BSTree<Integer>();
for(int i: data) tree.insert(i);
tree.inorder(data, new Process<Integer>(), tree.getRoot()); // I get an error here!
}
}
的错误是:
cannot find symbol - method inorder(int[], Process<java.lang.Integer>, BTNode<java.lang.Integer>); maybe you meant: inorder(E[], Process<E>, BTNode<E>);
我修改了treeSort(int[] data)
到treeSort(Integer[] data)
。但我在treeSort(temp);
得到的主要方法错误,错误的是:
treeSort(java.lang.Integer) in Main cannot be applied to (int[])
所以,我该怎么处理这个问题有考虑到不增加复杂性时,我应该试试这个方法一百万输入?
你有史以来最差的医生。我通常只是收钱给他看。 – Woot4Moo 2011-05-19 14:18:56