Scribd Logo
Upload

Welcome to Scribd!

  • 48 views

    Algorithm Analysis

    Uploaded by

    Muzamil Yousaf
    This document discusses different types of algorithm analysis, including a priori analysis, a posteriori analysis, and complexity analysis. It defines a priori analysis as the theoretical analysis of an algorithm's efficiency assuming constant factors, while a posteriori analysis examines the actual running time and space needed after implementation. Algorithm complexity analysis measures how the running time and space requirements grow as the input size increases. The document then discusses space complexity and how it represents the memory needed, including fixed and variable parts. Finally, it defines time complexity as representing the amount of time an algorithm takes to complete as a function of the input size.

    Copyright:

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

    Algorithm Analysis

    Uploaded by

    Muzamil Yousaf
    48 views2 pages
    This document discusses different types of algorithm analysis, including a priori analysis, a posteriori analysis, and complexity analysis. It defines a priori analysis as the theoretical analysis of an algorithm's efficiency assuming constant factors, while a posteriori analysis examines the actual running time and space needed after implementation. Algorithm complexity analysis measures how the running time and space requirements grow as the input size increases. The document then discusses space complexity and how it represents the memory needed, including fixed and variable parts. Finally, it defines time complexity as representing the amount of time an algorithm takes to complete as a function of the input size.

    Original Description:

    Data Structure and Algorithm

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document discusses different types of algorithm analysis, including a priori analysis, a posteriori analysis, and complexity analysis. It defines a priori analysis as the theoretical analysis of an algorithm's efficiency assuming constant factors, while a posteriori analysis examines the actual running time and space needed after implementation. Algorithm complexity analysis measures how the running time and space requirements grow as the input size increases. The document then discusses space complexity and how it represents the memory needed, including fixed and variable parts. Finally, it defines time complexity as representing the amount of time an algorithm takes to complete as a function of the input size.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    48 views2 pages

    Algorithm Analysis

    Uploaded by

    Muzamil Yousaf
    This document discusses different types of algorithm analysis, including a priori analysis, a posteriori analysis, and complexity analysis. It defines a priori analysis as the theoretical analysis of an algorithm's efficiency assuming constant factors, while a posteriori analysis examines the actual running time and space needed after implementation. Algorithm complexity analysis measures how the running time and space requirements grow as the input size increases. The document then discusses space complexity and how it represents the memory needed, including fixed and variable parts. Finally, it defines time complexity as representing the amount of time an algorithm takes to complete as a function of the input size.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    of 2

    Algorithm Analysis

    Analysis of efficiency of an algorithm can be performed at two different stages, before


    implementation and after implementation, as
    A priori analysis − This is defined as theoretical analysis of an algorithm. Efficiency of
    algorithm is measured by assuming that all other factors e.g. speed of processor, are
    constant and have no effect on implementation.
    A posterior analysis − This is defined as empirical analysis of an algorithm. The chosen
    algorithm is implemented using programming language. Next the chosen algorithm is
    executed on target computer machine. In this analysis, actual statistics like running time
    and space needed are collected.
    Algorithm analysis is dealt with the execution or running time of various operations
    involved. Running time of an operation can be defined as number of computer
    instructions executed per operation.

    Algorithm Complexity
    Suppose X is treated as an algorithm and N is treated as the size of input data, the time
    and space implemented by the Algorithm X are the two main factors which determine
    the efficiency of X.
    Time Factor − The time is calculated or measured by counting the number of key
    operations such as comparisons in sorting algorithm.
    Space Factor − The space is calculated or measured by counting the maximum memory
    space required by the algorithm.
    The complexity of an algorithm f(N) provides the running time and / or storage space
    needed by the algorithm with respect of N as the size of input data.

    Space Complexity
    Space complexity of an algorithm represents the amount of memory space needed the
    algorithm in its life cycle.
    Space needed by an algorithm is equal to the sum of the following two components
    A fixed part that is a space required to store certain data and variables (i.e. simple
    variables and constants, program size etc.), that are not dependent of the size of the
    problem.
    A variable part is a space required by variables, whose size is totally dependent on the
    size of the problem. For example, recursion stack space, dynamic memory allocation
    etc.
    Space complexity S(p) of any algorithm p is S(p) = A + Sp(I) Where A is treated as the
    fixed part and S(I) is treated as the variable part of the algorithm which depends on
    instance characteristic I. Following is a simple example that tries to explain the concept
    Algorithm
    SUM(P, Q)
    Step 1 - START
    Step 2 - R ← P + Q + 10
    Step 3 - Stop
    Here we have three variables P, Q and R and one constant. Hence S(p) = 1+3. Now
    space is dependent on data types of given constant types and variables and it will be
    multiplied accordingly.

    Time Complexity
    Time Complexity of an algorithm is the representation of the amount of time required by
    the algorithm to execute to completion. Time requirements can be denoted or defined
    as a numerical function t(N), where t(N) can be measured as the number of steps,
    provided each step takes constant time.
    For example, in case of addition of two n-bit integers, N steps are taken. Consequently,
    the total computational time is t(N) = c*n, where c is the time consumed for addition of
    two bits. Here, we observe that t(N) grows linearly as input size increases.

    You might also like