Searching: Sequential Search

Algorithm S

Algorithm S (Sequential search). Given a table of records R1,R2,…, RN
whose respective keys are K1,K2, … ,KN, this algorithm searches for a given
argument K. We assume that N >= 1.
S1. [Initialize.] Set i <– 1.
S2. [Compare.] If K = Ki, the algorithm terminates successfully.
S3. [Advance.] Increase i by 1.
S4. [End of file?] If i <= N, go back to S2. Otherwise the algorithm terminates
unsuccessfully. |

---

Flow diagram

---

Java program

In this program, R1,…,RN were simplified to K1,…,KN.

/**
 * Created with IntelliJ IDEA.
 * User: 1O1O
 * Date: 12/10/13
 * Time: 6:52 PM
 * :)~
 * Sequential Search:Searching
 */
public class Main {

    public static void main(String[] args) {
        int N = 16;
        int[] K = new int[17];

        /*Prepare the data*/
        K[1] = 503;
        K[2] = 87;
        K[3] = 512;
        K[4] = 61;
        K[5] = 908;
        K[6] = 170;
        K[7] = 897;
        K[8] = 275;
        K[9] = 653;
        K[10] = 426;
        K[11] = 154;
        K[12] = 509;
        K[13] = 612;
        K[14] = 677;
        K[15] = 765;
        K[16] = 703;

        /*Output unsorted Ks*/
        System.out.println("Unsorted Ks:");
        for(int i=1; i<=N; i++){
            System.out.println(i+":"+K[i]);
        }
        System.out.println();

        /*Kernel of the Algorithm!*/
        int Key = 653;              /*Key to be found*/
        int i;

        for(i=1; i<=N; i++){
            if(Key == K[i]){
                System.out.println("Outputs: "+Key+" in K["+i+"].");
                break;
            }
        }
        if(i > N){
            System.out.println("Outputs: "+Key+" not found.");
        }
    }
}

---

Outputs

Unsorted Ks:
1:503
2:87
3:512
4:61
5:908
6:170
7:897
8:275
9:653
10:426
11:154
12:509
13:612
14:677
15:765
16:703

Outputs: 653 in K[9].

---

Reference

<< The art of computer programming: Sorting and Searching >> VOLUME 3, DONALD E. KNUTH