循序搜寻培训课件.pptVIP

循序搜尋 南台科大 電子系 黎 靖 循序搜尋(Sequential Search) 資料不須事先排序。 按順序從頭到尾地搜尋。 直到找到相同資料為止。 例1: 例1: 例1: 例1: 例1: 例2: 例2: 例2: 例2: 例2: 例2: 例2: 例2: 例2: 例2: 例2: EX： 循序搜尋演算法 循序搜尋演算法必須告知呼叫者兩件事： 第一、搜尋是否成功？ 第二、搜尋成功時目標元素的索引值為何？ 為了回答這些問題，搜尋演算法需要四個參數： (1) 要被搜尋的串列； (2) 串列中最後一個元素的索引值； (3) 搜尋目標； (4) 目標元素索引值的儲存位址。 循序搜尋演算法 Problem: Search the location of x in S Inputs: positive integer n, array of keys S indexed from 1 to n, and a key x. Outputs: location, the location of x in S (0 if x ? S). Strategy: The method scans the elements, one after another, until succeeds or it exhausts the range: 循序搜尋演算法(1) void seq1 (int n, Keytype S[ ], Keytype x, Index location) { // index denote location is an output parameter. for (location = 1; location = n S[location] != x; location ++) ; if (location n) location = 0; } 循序搜尋演算法(2) void seq2 (int n, Keytype S[ ], Keytype x, Index location) { location = 1; while (location = n S[location] != x) location++; if (location n) location = 0; } 循序搜尋演算法(3) void seq3(unsigned n, const Keytype S[ ], const Keytype x, Index location) { location = 0; while (++location = n S[location] != x) ; if (location n) location = 0; } 循序搜尋演算法(4) void seq4 (int n, Keytype S[ ], Keytype x, Index location) { location = 1; while (location++ = n S[location] != x) ; if (location n) location = 0; } 循序搜尋演算法(5) void seq5(int n, Keytype S[ ], Keytype x, Index location) { location = 1; while (location = n S[location++] != x) ; if (location n) location = 0; } 循序搜尋演算法(6) void seq6(const unsigned n, Keytype S[ ], Keytype x, Index location) { S[n+1] = x; // Set a sentinel at the end of S. location = 0; while (S[++location] != x); if (location n) location = 0; } 循序搜尋演算法(7) void seq7(const unsigned n, const Keytype S[ ], Keytype x, Index location) { S[n+1] = x; // Set a sentinel at the end of S. location = 0;