Scribd Logo
Upload

Welcome to Scribd!

  • 12 views

    Brute Force Algorithm

    Uploaded by

    Dan
    The document discusses the brute force algorithm. It defines brute force as a straightforward approach to problem solving by trying all possible solutions in a systematic way. It then provides examples of the pros and cons of brute force, including its simplicity but low efficiency. Next, it analyzes the best and worst case time complexities of brute force through the example of sequential search. It gives pseudocode for sequential search and illustrates its step-by-step process on a sample array. Finally, it concludes the discussion of brute force and sequential search.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Flag for inappropriate content

    You might also like

    Brute Force Algorithm

    Uploaded by

    Dan
    12 views17 pages
    The document discusses the brute force algorithm. It defines brute force as a straightforward approach to problem solving by trying all possible solutions in a systematic way. It then provides examples of the pros and cons of brute force, including its simplicity but low efficiency. Next, it analyzes the best and worst case time complexities of brute force through the example of sequential search. It gives pseudocode for sequential search and illustrates its step-by-step process on a sample array. Finally, it concludes the discussion of brute force and sequential search.

    Original Description:

    Power Point Brute Force

    Original Title

    PPT Brute Force Algorithm

    Copyright

    © © All Rights Reserved

    Available Formats

    PPTX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document discusses the brute force algorithm. It defines brute force as a straightforward approach to problem solving by trying all possible solutions in a systematic way. It then provides examples of the pros and cons of brute force, including its simplicity but low efficiency. Next, it analyzes the best and worst case time complexities of brute force through the example of sequential search. It gives pseudocode for sequential search and illustrates its step-by-step process on a sample array. Finally, it concludes the discussion of brute force and sequential search.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pptx, pdf, or txt
    12 views17 pages

    Brute Force Algorithm

    Uploaded by

    Dan
    The document discusses the brute force algorithm. It defines brute force as a straightforward approach to problem solving by trying all possible solutions in a systematic way. It then provides examples of the pros and cons of brute force, including its simplicity but low efficiency. Next, it analyzes the best and worst case time complexities of brute force through the example of sequential search. It gives pseudocode for sequential search and illustrates its step-by-step process on a sample array. Finally, it concludes the discussion of brute force and sequential search.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pptx, pdf, or txt
    of 17

    BRUTE FORCE

    HELMA LIANA 123200030


    PUTRI
    WINDY FEBRIANTI 123200036
    ODE
    WAYAN DANU 123200025
    TIRTA
    BRUTE FORCE

    DEFINI KOMPLEKSIT
    SI AS
    PSEUDOCO ILUSTRAS
    DE I
    01. DEFINISI
    APA ITU BRUTE FORCE?

    Brute Force merupakan sebuah pendekatan yang bersifat


    langsung atau Straight Forward yang digunakan untuk
    memecahkan suatu masalah. Algoritma brute force
    memecahkan masalah dengan sangat sederhana, langsung
    dan dengan cara yang jelas (obvious way).
    KELEBIHAN & KEKURANGAN

    KELEBIHAN KEKURANGAN

    1. Bisa digunakan untuk memecahkan 1. Jarang menghasilkan algoritma yang


    hampir semua masalah. mangkus.
    2. Algoritma Brute Force mudah dimengerti. 2. Algoritma ini terhitung lambat.
    3. Mudah diaplikasikan dalam permasalahan. 3. Tidak sekreatif teknik pemecahan masalah
    lainnya.
    02. KOMPLEKSITAS
    BAGAIMANA KOMPLEKSITASNYA?
    Untuk kompleksitas dari algoritma Brute Force ini kami
    mengambil contoh penerapannya dari proses Sequential Search,
    yang terdiri dari :

    01. Kemungkinan Terbaik (Best Case)

    02. Kemungkinan Terburuk (Worse Case)


    03. PSEUDOCODE
    Sequential Search

    Pseudocode_sequential_search
    Deklarasi
    const N : integer
    type A : array [0...N] of integer
    search : integer;
    found : boolean
    Sequential Search
    Algoritma
    input(search)
    found = false
    for i from i to N
    if (ar[i] == search)
    print(search + " ada pada
    index ke - " + i)
    found = true
    break
    endif
    enfor
     
    if(found == false)
    print(search + " tidak ada dalam array")
    endif
    endprocedure
    04. ILUSTRASI
    ILUSTRASI SEQUENTIAL SEARCH
    Target nilai 3

    ILUSTRASI Isi 9 7 2 10 15 3 8 17 28 25
    ARRAY Index 0 1 2 3 4 5 6 7 8 9

    PROSE
    S

    Isi 9 7 2 10 15 3 8 17 28 25
    LANGKAH
    1 Index 0 1 2 3 4 5 6 7 8 9

    TARGE
    T
    ILUSTRASI SEQUENTIAL SEARCH
    PROSE
    S

    Isi 9 7 2 10 15 3 8 17 28 25
    LANGKAH
    2 Index 0 1 2 3 4 5 6 7 8 9

    TARGE
    PROSE T
    S

    Isi 9 7 2 10 15 3 8 17 28 25
    LANGKAH
    3 Index 0 1 2 3 4 5 6 7 8 9

    TARGE
    ILUSTRASI SEQUENTIAL SEARCH
    PROSE
    S

    Isi 9 7 2 10 15 3 8 17 28 25
    LANGKAH
    4 Index 0 1 2 3 4 5 6 7 8 9

    TARGE
    PROSE T
    S

    Isi 9 7 2 10 15 3 8 17 28 25
    LANGKAH
    5 Index 0 1 2 3 4 5 6 7 8 9

    TARGE
    ILUSTRASI SEQUENTIAL SEARCH
    PROSE
    S

    Isi 9 7 2 10 15 3 8 17 28 25
    LANGKAH
    6 Index 0 1 2 3 4 5 6 7 8 9

    TARGE
    T

    OUTPUT :
    “PENCARIAN DITEMUKAN DI
    INDEX KE 5”
    Isi 9 7 2 10 15 3 8 17 28 25
    HASIL
    Index 0 1 2 3 4 5 6 7 8 9
    05. KESIMPULAN
    THANKS!

    You might also like