说明：  顺序查找的基本思想是：从表的一端开始，顺序扫描线性表，依次将扫描到的结点、关键字和给定值k相比较，若当扫描到的结点与k相等，则查找成功；若扫描结束后仍未找到等于k的结点，则查找失败。
(The basic idea of ​ ​ sequential search: start from one end of the table, sequential scanning linear form, and in turn will scan to the node, keywords, and given the value of k compared, when scanning to node k is equal to the Find success yet to find the end of the scan is equal to k nodes, the lookup fails.)