Scribd Logo
Upload

Welcome to Scribd!

  • 17 views

    Local Search - Brute Force Search

    Uploaded by

    hamo
    This document discusses brute force search, an algorithm with O(N) time complexity that examines all possible solutions within a given interval to find the optimal solution. It works by iterating through the interval and doing a maximum/minimum find at each point to determine the true optimal. While slow, brute force search is guaranteed to always find the true maximum or minimum value of a function over an interval.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd

    Local Search - Brute Force Search

    Uploaded by

    hamo
    17 views15 pages
    This document discusses brute force search, an algorithm with O(N) time complexity that examines all possible solutions within a given interval to find the optimal solution. It works by iterating through the interval and doing a maximum/minimum find at each point to determine the true optimal. While slow, brute force search is guaranteed to always find the true maximum or minimum value of a function over an interval.

    Original Description:

    5768 t6 67z76 u8ujji

    Original Title

    bruteforce34

    Copyright

    © © All Rights Reserved

    Available Formats

    PPTX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document discusses brute force search, an algorithm with O(N) time complexity that examines all possible solutions within a given interval to find the optimal solution. It works by iterating through the interval and doing a maximum/minimum find at each point to determine the true optimal. While slow, brute force search is guaranteed to always find the true maximum or minimum value of a function over an interval.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Download as pptx, pdf, or txt
    17 views15 pages

    Local Search - Brute Force Search

    Uploaded by

    hamo
    This document discusses brute force search, an algorithm with O(N) time complexity that examines all possible solutions within a given interval to find the optimal solution. It works by iterating through the interval and doing a maximum/minimum find at each point to determine the true optimal. While slow, brute force search is guaranteed to always find the true maximum or minimum value of a function over an interval.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Download as pptx, pdf, or txt
    You are on page 1of 15

    Chapter 3

    LOCAL SEARCH – BRUTE FORCE SEARCH


     We just iterate through the given interval and do a brute-force
    maximum/minimum find
     O(N) time complexity
     We examine all possible solutions: it can be very slow
     BUT always find the optimal solution
    f(x)

    x
    f(x)

    x
    -5 20
    f(x)

    dx
    x
    -5 20
    f(x)

    dx
    x
    -5 20
    f(x)

    dx
    x
    -5 20
    f(x)

    dx
    x
    -5 20
    f(x)

    dx
    x
    -5 20
    f(x)

    dx
    x
    -5 20
    f(x)

    dx
    x
    -5 20
    f(x)

    dx
    x
    -5 20
    f(x)

    dx
    x
    -5 20
    f(x)

    dx
    x
    -5 20
    f(x)

    This is the maximum!

    dx
    x
    -5 20

    You might also like