数据结构与算法读书笔记4----C# 查找数组中指定数字，最小值，最大值。

C# 查找数组中指定数字，最小值，最大值。

代码 1 class Program
2 {
3 static void Main(string[] args)
4 {
5 int searchNumber;
6 bool found;
7 //TestArray nums = new TestArray(10);
8 int[] nums = new int[10] { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 };
9 #region 初始化数组
//Random rnd = new Random(100);
//for (int num = 0; num < 10; num++)
//{
// nums.Insert(rnd.Next(0, 100));
//}
#endregion
Console.WriteLine("Enter a num to search for:");
searchNumber = Convert.ToInt32(Console.ReadLine());
found = NumSearch(nums,searchNumber);
if (found)
{
Console.WriteLine(searchNumber + "is in the array.");
}
else
{
Console.WriteLine(searchNumber + "is not in the array.");
}
//查找数组中最小值函数
int min=FindMin(nums);
int max = FindMax(nums);
Console.WriteLine(min.ToString());
Console.WriteLine(max.ToString());
#region 排序实现
//Console.WriteLine("Before Sorting: ");
//nums.DisplayElements();
//Console.WriteLine("Durring Sorting: ");
//nums.InsertionSort();
//Console.WriteLine("After Sorting: ");
//nums.DisplayElements();
#endregion
Console.ReadLine();
}
//<summary>
//查找数组中制定数字的方法
//<param name="arr">数组</param>
//<param name="value">数字</param>
//</summary>
//<returns>bool</returns>
public static bool NumSearch(int [] arr,int value)
{
for (int index = 0; index < arr.Length; index++)
{
if (arr[index] == value)
{
return true;
}
}
return false;
}
//<summary>
//查找数组中最小数字的方法
//<param name="arr">数组</param>
//</summary>
//<returns>bool</returns>
public static int FindMin(int[] arr)
{
int min = arr[0];
for (int index = 1; index < arr.Length; index++)
{
if (arr[index] < min)
{
min=arr[index];
}
}
return min;
}
//<summary>
//查找数组中最大数字的方法
//<param name="arr">数组</param>
//</summary>
//<returns>bool</returns>
public static int FindMax(int[] arr)
{
int max = arr[0];
for (int index = 1; index < arr.Length; index++)
{
if (arr[index] > max)
{
max = arr[index];
}
}
return max;
}

}