using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
namespace Sequential
{
class Program
{
static void Main(string[] args)
{
Listint> list = new Listint>() { 2, 3, 5, 8, 7 };
var result = SequenceSearch(list, 3);
if (result != -1)
Console.WriteLine("3 已經(jīng)在數(shù)組中找到，索引位置為：" + result);
else
Console.WriteLine("嗚嗚，沒有找到！");
Console.Read();
}
//順序查找
static int SequenceSearch(Listint> list, int key)
{
for (int i = 0; i list.Count; i++)
{
//查找成功，返回序列號
if (key == list[i])
return i;
}
//未能查找，返回-1
return -1;
}
}
}
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
namespace BinarySearch
{
class Program
{
static void Main(string[] args)
{
Listint> list = new Listint>() { 3, 7, 9, 10, 11, 24, 45, 66, 77 };
var result = BinarySearch(list, 45);
if (result != -1)
Console.WriteLine("45 已經(jīng)在數(shù)組中找到，索引位置為：" + result);
else
Console.WriteLine("嗚嗚，沒有找到！");
Console.Read();
}
///summary>
/// 折半查找
////summary>
///param name="list">/param>
///returns>/returns>
public static int BinarySearch(Listint> list, int key)
{
//最低線
int low = 0;
//最高線
int high = list.Count - 1;
while (low = high)
{
//取中間值
var middle = (low + high) / 2;
if (list[middle] == key)
{
return middle;
}
else
if (list[middle] > key)
{
//下降一半
high = middle - 1;
}
else
{
//上升一半
low = middle + 1;
}
}
//未找到
return -1;
}
}
}
