C# Array操作

/*
实验Array类的方法。
*/
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;

namespace ConsoleApplication2
{
    class Program
    {
        static void Main(string[] args)
        {
            int[] nums = { 2, 7, 5, 3, 6 };
            Console.WriteLine("数组中元素个数为：{0}",nums.GetLength(0));
            Console.WriteLine("数组上界为：{0}",nums.GetUpperBound(0));
            Array.Sort(nums);          //对指定数组升序排序
            Console.Write("数组排序后为:");
            for (int i = 0; i < nums.Length; i++)
                Console.Write("{0} ", nums[i]);
            Console.WriteLine();
            Array.Reverse(nums);         //对数组元素进行逆序
            Console.Write("数组反序后为:");
            for (int i = 0; i < nums.Length; i++)
                Console.Write("{0} ", nums[i]);
            Console.WriteLine();
            int[] numsc = new int[nums.Length];
            Array.Copy(nums, numsc, nums.Length); //将nums数组复制到numsc数组
            Console.Write("复制后的数组为:");
            for (int i = 0; i < nums.Length; i++)
                Console.Write("{0} ", numsc[i]);
            int n = Array.IndexOf(nums, 5);    //IndexOf(array,value,startindex):从startindex开始查找value元素的位置
            Console.WriteLine();
            Console.WriteLine("元素位置为：{0}", n + 1);
            Array.Reverse(nums);
            int m = Array.BinarySearch(nums, 6);    //对已排序的数组使用二分查找搜索，返回元素6的位置
            Console.WriteLine("元素6的位置为：{0}", m + 1);
            Array.Clear(nums, 2, 3);         //对数组一系列元素清零，false或true
            Console.Write("Clear后的数组为:");
            for (int i = 0; i < nums.Length; i++)
                Console.Write("{0} ", nums[i]);
            Console.ReadKey();
        }
    }
}

运行结果：