UC知道MERGE 算法 C#
来源：百度知道 编辑：UC知道 时间：2024/07/02 04:42:17
using System;
using System.Collections.Generic;
using System.Text;
namespace Exercise1_merge_sort
{
class List
{
private int[] arr = new int[20];
private int[] sort=new int [20];
int n;
public List()
{
}
void read()
{
while (true)
{
Console.Write("Enter the number of elements in the arrary:");
string s = Console.ReadLine();
n = Int32.Parse(s);
if (n <= 20)
break;
else
Console.WriteLine("\nArrary can have maximum 20 elements.\n");
}
Console.WriteLine("---------------------------");
Console.WriteLine(" Enter arrary elements ");
using System.Collections.Generic;
using System.Text;
namespace Exercise1_merge_sort
{
class List
{
private int[] arr = new int[20];
private int[] sort=new int [20];
int n;
public List()
{
}
void read()
{
while (true)
{
Console.Write("Enter the number of elements in the arrary:");
string s = Console.ReadLine();
n = Int32.Parse(s);
if (n <= 20)
break;
else
Console.WriteLine("\nArrary can have maximum 20 elements.\n");
}
Console.WriteLine("---------------------------");
Console.WriteLine(" Enter arrary elements ");
数组里面元素就是0。
输出不是0是什么。
//声明一个含20个int型数的数组，初始化元素都是0
private int[] arr = new int[20];
private int[] arr = new int[20];
Random rm = new Random();
for(int i = 0;i<arr.Length;i++)
{
//通过随机数给数组元素赋值
arr[i] = rm.Next()；
}
private int[] arr = new int[20];
private int[] sort=new int [20];
==>
public int[] arr = new int[20];
public int[] sort=new int [20];