Scribd Logo
Upload

Welcome to Scribd!

  • Flowchart Program Searching Yg D Print Ulang Bab VI

    Uploaded by

    Dewa Dede
    333 views1 page
    The flowchart shows a program for searching through an array of integer data. It begins by inputting the number of data values (n) and storing the data in an array called Deret. It then uses a loop to iterate through each element of the array from i=1 to i=n, outputting the value at each position. If the position i matches the input search value, it terminates and outputs that the value was found at position i. Otherwise, it continues to the next position until all positions have been checked.

    Original Description:

    Original Title

    Flowchart Program Searching Yg d Print Ulang Bab VI

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The flowchart shows a program for searching through an array of integer data. It begins by inputting the number of data values (n) and storing the data in an array called Deret. It then uses a loop to iterate through each element of the array from i=1 to i=n, outputting the value at each position. If the position i matches the input search value, it terminates and outputs that the value was found at position i. Otherwise, it continues to the next position until all positions have been checked.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    333 views1 page

    Flowchart Program Searching Yg D Print Ulang Bab VI

    Uploaded by

    Dewa Dede
    The flowchart shows a program for searching through an array of integer data. It begins by inputting the number of data values (n) and storing the data in an array called Deret. It then uses a loop to iterate through each element of the array from i=1 to i=n, outputting the value at each position. If the position i matches the input search value, it terminates and outputs that the value was found at position i. Otherwise, it continues to the next position until all positions have been checked.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 1

    Flowchart Program Searching

    START A I,j,n,data :integer Deret:array[1..10 0]of integer Readln(data) Input banyak data(n)

    Deret[i]=data

    i:=1 Deret[i]:=Data I=i+1 Suku ke- [i]


    T Y

    I:=data
    Y

    Pada posisi, I

    i=n?

    END

    j:=1 Deret[j],,
    T

    j=j+1

    j=n?
    Y

    Masukkan data yg di cari

    A
    Gambar 6.2 Flowchart Searching

    You might also like