顺序表的查找

#include <iostream>

int main()
{
    SqList L;
    L.length = 5;
    L.elem[0] = 30;
    L.elem[1] = 40;
    L.elem[2] = 50;
    L.elem[3] = 60;
    L.elem[4] = 70;
    ElemtType e = 40;

  int a=  loc(L, e);
  if (a > 0) {
      std::cout << "找到了下标为"<<a<<"元素是"<<e;
  }
  else
  {
      std::cout << "没找到元素";
          
  }

    std::cout << "Hello World!\n";
    std::cout << "hhhh";
}

//ElemtType设为int类型，比直接int  elemType更加灵活
typedef int ElemtType;
//定义一个最大的值
#define  MAX_SIZE 10
//定义一个顺序结构体
struct SqList
{
    ElemtType elem[MAX_SIZE];//最大数组元素
    int length;//当前元素长度
};

int loc(SqList L, ElemtType e) {
    for (size_t i = 0; i < L.length; i++)
    {
        if (L.elem[i] == e)//如果顺序表的元素等于我要查找的元素
        {
            return i + 1;//则返回下标+1就是位置了

        }
    }
    return 0;
}