Scribd Logo
Upload

Welcome to Scribd!

  • Graphhss

    Uploaded by

    Chetan Lunthi
    6 views4 pages
    The document describes two algorithms for finding if a key element is present in an array: 1) A linear algorithm that searches an unsorted array in O(n) time, counting the comparisons for each input size. 2) A logarithmic algorithm that searches a sorted array in O(logn) time, also counting comparisons for each input size.

    Original Description:

    Original Title

    graphhss

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document describes two algorithms for finding if a key element is present in an array: 1) A linear algorithm that searches an unsorted array in O(n) time, counting the comparisons for each input size. 2) A logarithmic algorithm that searches a sorted array in O(logn) time, also counting comparisons for each input size.

    Copyright:

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

    Graphhss

    Uploaded by

    Chetan Lunthi
    The document describes two algorithms for finding if a key element is present in an array: 1) A linear algorithm that searches an unsorted array in O(n) time, counting the comparisons for each input size. 2) A logarithmic algorithm that searches a sorted array in O(logn) time, also counting comparisons for each input size.

    Copyright:

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

    OUTPUT

    Q1. Given an array of nonnegative integers, design a linear algorithm and


    implement it using a program to find whether given key element is present
    in the array or not. Also, find total number of comparisons for each input
    case. (Time Complexity = O(n), where n is the size of input)

    GRAPH Q1

    0.000016
    0.000014
    0.000012
    0.00001
    TIME

    0.000008
    0.000006
    0.000004
    0.000002
    0
    1000 2000 3000 4000

    NO OF ITEMS
    OUTPUT
    Q2. Given an already sorted array of positive integers, design an algorithm
    and implement it using a program to find whether given key element is
    present in the array or not. Also, find total number of comparisons for each
    input case. (Time Complexity = O(logn), where n is the size of input)

    GRAPH Q2

    0.00002

    0.000015
    Time

    0.00001

    0.000005

    0
    1000 2000 3000 4000

    No of Elements

    You might also like