查找算法

最新推荐文章于 2024-01-05 10:30:21 发布

龙心之火

最新推荐文章于 2024-01-05 10:30:21 发布

阅读量1.2k

点赞数 1

分类专栏： C# Java C++ 文章标签：查找算法

本文链接：https://blog.csdn.net/lxzh12345/article/details/24118835

版权

C# 同时被 3 个专栏收录

10 篇文章 0 订阅

订阅专栏

Java

8 篇文章 0 订阅

订阅专栏

C++

4 篇文章 0 订阅

订阅专栏

1、顺序查找算法

C++ Code

int OrderFind(int* a,int n, int x)
{
	for (int i = 0; i < n; i++)
	{
		if (a[i] == x)
			return i;
	}
	return -1;
}

C# Code

        public int OrderFind(int[] array, int x)
        {
            int count = array.Length;
            for (int i = 0; i < count; i++)
            {
                if (array[i] == x)
                    return i;
            }
            return -1;
        }

Java Code

    public int OrderFind(int[] array, int x)
    {
        int count = array.length;
        for (int i = 0; i < count; i++)
        {
            if (array[i] == x)
                return i;
        }
        return -1;
    }

2、二分查找(对半)算法

C++ Code

//二分查找递归算法
int BinarySearch(int* a, int x, int low, int high)
{
	int mid = -1;
	if (low <= high)
	{
		if (a[mid] < x) mid = BinarySearch(a, x, mid + 1, high);
		else if (x < a[mid]) mid = BinarySearch(a, x, low, mid - 1);
	}
	return mid;
}

//二分查找迭代算法
int BinarySearch(int* a,int n, int x)
{
	int low = 0, high = n - 1,mid=-1;
	while (low <= high)
	{
		mid = (low + high) / 2;
		if (x < a[mid]) high = mid - 1;
		else if (x > a[mid]) low = mid + 1;
		else return mid;
	}
	if (a[mid] != x) mid = -1;
	return mid;
}

C# Code

        //二分查找递归算法
        public int BinarySearch(int[] array, int x, int low, int high)
        {
            int mid = -1;
            if (low <= high)
            {
                if (array[mid] < x) mid = BinarySearch(array, x, mid + 1, high);
                else if (x < array[mid]) mid = BinarySearch(array, x, low, mid - 1);
            }
            return mid;
        }

        //二分查找迭代算法
        public int BinarySearch(int[] array, int x)
        {
            int count = array.Length;
            int low = 0, high = count - 1,mid=-1;
            while (low <= high)
            {
                mid = (low + high) / 2;
                if (x < array[mid]) high = mid - 1;
                else if (x > array[mid]) low = mid + 1;
                else return mid;
            }
            if (array[mid] != x) mid = -1;
            return mid;
        }

Java Code

    //二分查找递归算法
    public int BinarySearch(int[] array, int x, int low, int high)
    {
        int mid = -1;
        if (low <= high)
        {
            if (array[mid] < x) mid = BinarySearch(array, x, mid + 1, high);
            else if (x < array[mid]) mid = BinarySearch(array, x, low, mid - 1);
        }
        return mid;
    }

    //二分查找迭代算法
    public int BinarySearch(int[] array, int x)
    {
        int count = array.length;
        int low = 0, high = count - 1,mid=-1;
        while (low <= high)
        {
            mid = (low + high) / 2;
            if (x < array[mid]) high = mid - 1;
            else if (x > array[mid]) low = mid + 1;
            else return mid;
        }
        if (array[mid] != x) mid = -1;
        return mid;
    }