Scribd Logo
Upload

Welcome to Scribd!

  • 32 views

    Lower Bound and Upper Bound

    Uploaded by

    Jessa Manatad
    The document discusses lower and upper bounds, which provide a way to find the lowest complexity of an algorithm to solve a problem. The lower bound is less than or equal to every element in a data set, while the upper bound is greater than or equal to every element. As an example, for the data set {3,5,11,20,23}, the lower bound is 3 and the upper bound is 23. The document was submitted by Jessa L. Manatad to instructor Marvin Garcia regarding lower and upper bounds.

    Copyright:

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

    You might also like

    Lower Bound and Upper Bound

    Uploaded by

    Jessa Manatad
    32 views1 page
    The document discusses lower and upper bounds, which provide a way to find the lowest complexity of an algorithm to solve a problem. The lower bound is less than or equal to every element in a data set, while the upper bound is greater than or equal to every element. As an example, for the data set {3,5,11,20,23}, the lower bound is 3 and the upper bound is 23. The document was submitted by Jessa L. Manatad to instructor Marvin Garcia regarding lower and upper bounds.

    Original Description:

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document discusses lower and upper bounds, which provide a way to find the lowest complexity of an algorithm to solve a problem. The lower bound is less than or equal to every element in a data set, while the upper bound is greater than or equal to every element. As an example, for the data set {3,5,11,20,23}, the lower bound is 3 and the upper bound is 23. The document was submitted by Jessa L. Manatad to instructor Marvin Garcia regarding lower and upper bounds.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    32 views1 page

    Lower Bound and Upper Bound

    Uploaded by

    Jessa Manatad
    The document discusses lower and upper bounds, which provide a way to find the lowest complexity of an algorithm to solve a problem. The lower bound is less than or equal to every element in a data set, while the upper bound is greater than or equal to every element. As an example, for the data set {3,5,11,20,23}, the lower bound is 3 and the upper bound is 23. The document was submitted by Jessa L. Manatad to instructor Marvin Garcia regarding lower and upper bounds.

    Copyright:

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

    Subject: 11.1.

    1 and EDUC 211


    First Semester (11.1.1F)
    2022-2023

    TOPIC: LOWER BOUND AND UPPER BOUND

    The lower and upper bound provides a way to find the lowest
    complexity of algorithm to solve a problem. The lower bound a value
    that is less than or equal to every element of a set of data. Upper
    bound a value that is greater than or equal to every element of a set
    of data.

    EXAMPLE:
    {3,5,11,20,23}

    Lower Bound- 3
    Upper Bound – 23

    Submitted by: Submitted to:


    JESSA L. MANATAD MARVIN GARCIA
    MAT-Filipino Instructor

    You might also like