jQuery火箭图标返回顶部代码

话不多说，直接上代码:

#include "stdafx.h"
#include<iostream>
using namespace std;
#define MAXSIZE 100

int F[100];

//无哨兵顺序查找，a为数组，n为要查找的数组个数，key为要查找的关键字
int Sequential_Search1(int *a, int n, int key)
{
    for (int i = 1; i <= n; i++)
    {
        if (a[i] == key)
            return i;
    }
    return 0;
}

//有哨兵顺序查找
int Sequential_Search2(int *a, int n, int key)
{
    a[0] = key;
    int i = n;
    while (a[i] != key)
    {
        i--;
    }
    return i;
}

//折半查找
int Binary_Search(int *a, int n, int key)
{
    int low, high, mid;
    low = 1;                      //定义最底下标为纪录首位
    high = n;                     //定义最高下标为记录末尾
    while (low <= high)
    {
        mid = (low + high) / 2;   //折半
        if (key < a[mid])         //若查找的值比中值小
            high = mid - 1;       //最高下标调整到中位下标小一位
        else if (key > a[mid])    //若查找的值比中值打
            low = mid + 1;        //最低下标调整到中位下标大一位
        else                      
        {
            return mid;           //若相等则说明mid即为查找到的位置
        }
    }
    return 0;
}

int main()
{
    int a[MAXSIZE + 1], result;
    int arr[MAXSIZE] = { 0,1,16,24,35,47,59,62,73,88,99 };

    for (int i = 0; i <= MAXSIZE; i++)
    {
        a[i] = i;
    }
    result = Sequential_Search1(a, MAXSIZE, 100);
    cout << "Sequential_Search1: " << result << endl;
    result = Sequential_Search2(a, MAXSIZE, 1);
    cout << "Sequential_Search2: " << result << endl;
    result = Binary_Search(arr, 10, 62);
    cout << "Binary_Search: " << result << endl;
    return 0;
}

输出如下: