数据结构中的顺序表和数表的查找算法。基本思想：从表的一端开始，顺序扫描线性表，依次将扫描到的结点的关键字与给定值k进行比较,若相等，则查找成功；若扫描到表的另一端仍没有找到与关键字k相等的结点，则查找失败。-Data structure in the order list and several forms of the search algorithm. The basic idea: to start from one end of the table, the order of the linear table scan, followed by scanning the nodes of a given keyword and compare the value of k, if equally divided, to find success　if scanning the other side of the table is still not found keyword k with the same node, then the failure to find.