public static void Main()
int target , seq_len = 5000 ;
Console.Write("請輸入想找的數字:");
target = int.Parse(Console.ReadLine());
int[] sequence = new int[seq_len];
Random rand = new Random();
sequence[0] = rand.Next(1,5001);
sequence[i] = rand.Next(1,5001);
if (sequence[j] == sequence[i])
sequence[i] = rand.Next(1,5001);
for (int i=0;i<sequence.Length;i++)
Console.WriteLine("【Linear Search】 當值為{0}時,共搜尋了{1}次後找到。",target,k);
for (int i=0; i<=seq_len; i++)
for (int j=0; j<seq_len-1; j++)
if (sequence[j]>sequence[j+1])
sequence[j]=sequence[j+1];
int low=0, high=seq_len-1, midpoint=0;
if (sequence[midpoint]==target)
Console.WriteLine("【Binary Search】 當值為{0}時,共搜尋了{1}次後找到。",target,y);
else if (sequence[midpoint]>target)
Console.WriteLine("Libear Search比Binary Search快");
Console.WriteLine("Binary Search比Libear Search快");
Console.WriteLine("Libear Search跟Binary Search的搜尋速度一樣");