C#数组求和，求最大数，最小数，平均值

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace ConsoleApplication3
{
    class Program
    {
        static void Main(string[] args)
        {
            int[] arr = new int[10];
            int count = 0;
            for (int i = 0; i < arr.Length; i++)
            {
                arr[i] = i + 1;
                Console.WriteLine(arr[i]);
                count += arr[i];
            }

            int max = arr[0];
            for (int i = 0; i < arr.Length; i++)
            {
                if (max<arr.Length)
                {
                    max = arr[i];
                }
            }
            int min = arr[0];
            for (int i = 0; i > arr.Length; i++)
            {
                if (min > arr.Length) //片段是否大于满足就最小的   最大数同理
                {
                    min = arr[i];
                }
            }
            Console.WriteLine("和="+count);
            Console.WriteLine("平均数="+count/arr.Length);
            Console.WriteLine("最大数"+max);
            Console.WriteLine("最小数" + min);
        }
    }
}

package Arry;

public class avgarry {
public static void main(String[] args) {
    int [] temp=new int[10];
     int count=0;
    for (int i = 0; i < temp.length; i++) {
        temp[i]=i+1;
        System.out.println(temp[i]);
        count+=temp[i];
    }
    
    int max=temp[0];
    for (int i = 0; i < temp.length; i++) {
        if (max<temp.length) {
            max=temp[i];
        }
    }
    int samll=temp[0];
    for (int i = 0; i < temp.length; i++) {
        if (samll>temp.length) {
            samll=temp[i];
        }
    }
    System.out.println("总数"+count);
    System.out.println("平均数"+count/temp.length);
    System.out.println("最大数"+max);
    System.out.println("最小数"+samll);
}
}