Scribd Logo
Upload

Welcome to Scribd!

  • DAA - Basics - Masters Theorem

    Uploaded by

    Vishnu Damuloori 22238587131
    5 views9 pages
    The document discusses algorithms analysis using the Master's Theorem. It provides examples of recurrence relations for various algorithms like binary search, merge sort, quicksort, and matrix multiplication. It then explains the Master's Theorem, which can be used to solve recurrence relations of the form T(n) = aT(n/b) + f(n). The theorem has three cases depending on whether logba is greater than, equal to, or less than k, where f(n) = O(nklogpn). It provides examples of applying the theorem to determine the time complexity of algorithms with different recurrence relations.

    Original Description:

    Original Title

    7. DAA_Basics_Masters Theorem

    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 algorithms analysis using the Master's Theorem. It provides examples of recurrence relations for various algorithms like binary search, merge sort, quicksort, and matrix multiplication. It then explains the Master's Theorem, which can be used to solve recurrence relations of the form T(n) = aT(n/b) + f(n). The theorem has three cases depending on whether logba is greater than, equal to, or less than k, where f(n) = O(nklogpn). It provides examples of applying the theorem to determine the time complexity of algorithms with different recurrence relations.

    Copyright:

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

    DAA - Basics - Masters Theorem

    Uploaded by

    Vishnu Damuloori 22238587131
    The document discusses algorithms analysis using the Master's Theorem. It provides examples of recurrence relations for various algorithms like binary search, merge sort, quicksort, and matrix multiplication. It then explains the Master's Theorem, which can be used to solve recurrence relations of the form T(n) = aT(n/b) + f(n). The theorem has three cases depending on whether logba is greater than, equal to, or less than k, where f(n) = O(nklogpn). It provides examples of applying the theorem to determine the time complexity of algorithms with different recurrence relations.

    Copyright:

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

    Design and Analysis of Algorithms

    Masters Theorem
    DAC Algorithms
    Algorithm Recurrence Relation Complexity
    Binary Search T(n) = T(n/2)+C O(log n)
    Max Min (Iterative) Best Case: n-1, Worst Case: n-1 + n-1 = 2(n-1) O(n)
    Max Min (Recursive) 3*n/2 – 2, T(n) = 2T(n/2) + 2 O(n)
    MergeSort T(n) = 2T(n/2) + n O(n log n)
    QuickSort Best Case: If the partition is on the middle, O(nlog n)
    T(n) = 2T(n/2) + n
    Worst Case: If the array is already sorted, O(n2)
    T(n) = T(n-1) + n
    Matrix Multiplication Iterative / DAC T(n) = 8T(n/2) + n2 O(n3)
    Strassen's Matrix Multiplication T(n) = 7T(n/2) + n2 O(nlog7) = O(n2.81)
    Iterative Algorithm

    ● for(i=1;i<=n;i++) O(n)
    ● for(i=1;i<=n;i=i+2) n/2 = O(n) // n/200 = O(n)
    ● for(i=n;i>=1;i--) O(n)
    ● for(i=1;i<n;i=i*2) O(log2n)
    ● for(i=1;i<n;i=i*3) O(log3n)
    ● for(i=n;i>=1;i=i/2) O(log2n)
    Recursive Algorithm

    T(n) = T(n-1)+1 O(n) Master’s Theorem (Decreasing


    = T(n-1)+n O(n2)
    Function)
    = T(n-1)+logn O(nlogn)
    = T(n-1)+n2 O(n3)
    = T(n-2)+1 n/2 O(n) T(n) = aT(n-b) + f(n)
    = T(n-100)+n O(n2) a>0, b>0 and f(n)=O(nk) where k>=0
    = 2T(n-1)+1 O(2n)
    = 2T(n-2)+1 O(2n/2) = O(2n) if(a=1): O(nk+1) = O(n*f(n))
    = 3T(n-1)+1 O(3n) if(a>1): O(nk*an/b) = O(f(n)*an/b)
    = 2T(n-1)+n O(n2n)
    if(a<1): O(nk) = O(f(n))
    Master’s Theorem (Dividing Function)

    ● T(n) = aT(n/b) + f(n) ● Case 2: if logba=k


    ● if p>-1 O(nklogp+1n)
    ● if a>=1 and b>1 ● if p=-1 O(nkloglogn)
    ● f(n) = O(nk logpn) ● if p<-1 O(nk)

    ● Case 1: if logba>k ● Case 3: if logba<k


    ● then ● if p>=0 O(nklogpn)
    ● O(n^logba) ● if p<0 O(nk)
    Contd…

    ● T(n) = aT(n/b) + f(n) ● T(n) = 2T(n/2)+1 = O(n)


    ● = 4T(n/2)+n = O(n2)
    ● if a>=1 and b>1 ● = 8T(n/2)+n2 = O(n3)
    ● f(n) = O(nk logpn) ● = 16T(n/2)+n = O(n4)
    ● = 9T(n/3)+1 = O(n2)
    ● Case 1: if logba>k then ● = 9T(n/3)+n = O(n2)
    ● O(n^logba)
    Contd…

    ● T(n) = aT(n/b) + f(n) ● T(n) = T(n/2)+1 = O(logn)


    ● = 2T(n/2)+n = O(nlogn)
    ● if a>=1 and b>1 ● = 2T(n/2)+nlogn = O(nlog2n)
    ● f(n) = O(nk logpn) ● = 4T(n/2)+n2 = O(n2logn)
    ● = 8T(n/2)+n3 = O(n3logn)
    ● Case 2: if logba=k ● = 4T(n/2)+(nlogn)2 = O(n2log3n)
    ● if p>-1 O(nklogp+1n)
    ● if p=-1 O(nkloglogn) ● = 2T(n/2)+n/logn = O(nloglogn)
    ● if p<-1 O(nk) ● = 2T(n/2)+n/log2n = O(n)
    Contd…

    ● T(n) = aT(n/b) + f(n) ● T(n) = T(n/2)+n = O(n)


    ● = 2T(n/2)+n2 = O(n2)
    ● if a>=1 and b>1
    ● f(n) = O(nk logpn) ● = 2T(n/2)+n2logn = O(n2logn)
    ● = 4T(n/2)+n3log2n = O(n3log2n)
    ● Case 3: if logba<k
    ● if p>=0 O(nklogpn) ● = 2T(n/2)+n2/logn = O(n2)
    ● if p<0 O(nk)
    From
    Gurpreet Singh Chhabra

    You might also like