Scribd Logo
Upload

Welcome to Scribd!

  • 6 views

    Unit II - Session 9

    Uploaded by

    sb8515
    This document discusses divide and conquer algorithms. It introduces binary search and analyzes its runtime using the Master's theorem. Binary search runs in logarithmic time, or O(logn) time complexity. The document also mentions other divide and conquer algorithms like merge sort, quicksort, and algorithms for finding maximum/minimum values, closest pairs, and convex hull problems.

    Copyright:

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

    Unit II - Session 9

    Uploaded by

    sb8515
    6 views8 pages
    This document discusses divide and conquer algorithms. It introduces binary search and analyzes its runtime using the Master's theorem. Binary search runs in logarithmic time, or O(logn) time complexity. The document also mentions other divide and conquer algorithms like merge sort, quicksort, and algorithms for finding maximum/minimum values, closest pairs, and convex hull problems.

    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 divide and conquer algorithms. It introduces binary search and analyzes its runtime using the Master's theorem. Binary search runs in logarithmic time, or O(logn) time complexity. The document also mentions other divide and conquer algorithms like merge sort, quicksort, and algorithms for finding maximum/minimum values, closest pairs, and convex hull problems.

    Copyright:

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

    Unit II - Session 9

    Uploaded by

    sb8515
    This document discusses divide and conquer algorithms. It introduces binary search and analyzes its runtime using the Master's theorem. Binary search runs in logarithmic time, or O(logn) time complexity. The document also mentions other divide and conquer algorithms like merge sort, quicksort, and algorithms for finding maximum/minimum values, closest pairs, and convex hull problems.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Download as pptx, pdf, or txt
    of 8

    UNIT II

    DIVIDE AND CONQUER

    Session – 9
    Syllabus
     Introduction, Binary Search - Merge sort and its
    algorithm analysis - Quick sort and its algorithm
    analysis - Strassen's Matrix multiplication - Finding
    Maximum and minimum - Algorithm for finding closest
    pair - Convex Hull Problem
    Introduction
    Divide/ Break
    Conquer / Solve
    Merge / Combine
    BINARY SEARCH ALGORITHM
    Binarysearch(a[n], key)
    start=0; end=n-1;
    While(start<=end)
    {
    mid=(start+end)/2;
    return mid
    if(a[mid]==key)
    return mid;
    else if(a[mid]<key)
    end=mid-1;
    else
    start=mid+1;
    }
    return -1;
    ANALYSIS
    Using Master’s theorem
    T(n) = T(n/2) + 1
    T(n) = aT(n/b) + f(n) where a >= 1 and b > 1
    a=1 b=2 f(n) = 1 = n0

    1. If f(n) < O(nlogba), then T (n) = ϴ (nlogba).

    2. If f(n) = ϴ (nlogba) , then T (n) = ϴ (nlogbalogn).

    3. If f(n) > Ω (nlogba), and f(n) satisfies the regularity condition, then T
    (n) = ϴ (f(n)).

    Calculate nlogba = nlog21 = n0


    Compare with f(n). Since f(n) < nlogba
    i.e. n0 = n0
    Case 3 is satisfied hence complexity is given as T(n) = Θ(f(n)) = Θ
    (n0logn) = Θ (logn)
    Worksheet No. 9

    You might also like