求数组中的最大数
public class zhaozuidashu {

    /**
     * @param args
     */
    public static void main(String[] args) {
        // TODO Auto-generated method stub
        double[] dscalr={34.5,76.7,68.6,15.6,89.5,34.8,88.7,65,81.8};
        System.out.print("输出的原始数据：");
        for(double row:dscalr)
            System.out.print(row+"\t");               
              int i, j = 0;
              double tem=0.0;
              for (i = 0; i < dscalr.length; i++) {
               if (dscalr[j] < dscalr[i + 1]) {
                tem = dscalr[i + 1];
                j = i + 1;
               }
              }
              System.out.println("max=" + tem);
｝
｝
新手，实在不知道该怎么下手

求数组的最大数，我有一个新的方法：
public class zhaozuidashu{
    public static void main(String[] args){
     double[] dscalr={34.5,76.7,68.6,15.6,89.5,34.8,88.7,65,81.8};
     Arrays.sort(dscalr);
     System.out.println(dscalr[dscalr.length-1]);
    }
}

十分感谢

你可以直接 Arrays.sort(dscalr);这是API方法排序自动的
下面的是传说中的插入式排序（很好理解）；
public static void main(String[] args) {
        // TODO Auto-generated method stub
        double[] dscalr = { 34.5, 76.7, 68.6, 15.6, 89.5, 34.8, 88.7, 65, 81.8 };
        int i, j, k;
        for (i = 1; i < dscalr.length; i++) {
            k = (int) dscalr[i];// 取出
            // 查找位置（从小到大排列）
            for (j = i - 1; j >= 0 && k < dscalr[j]; j--) {
                dscalr[j + 1] = dscalr[j];
            
            }
            dscalr[j + 1] = k;
        }
        System.out.println(dscalr[dscalr.length-1]);//最大的肯定是最后一位

    }

谢谢