Scribd Logo
Upload

Welcome to Scribd!

  • CH One Part 1

    Uploaded by

    gadisa Ararsa
    4 views52 pages
    This document discusses algorithms, including their characteristics, design paradigms like brute force, divide and conquer, and greedy paradigms. It also covers algorithm analysis concepts such as measuring efficiency through empirical and machine independent methods. Types of complexity analysis are examined like best, worst, average cases. Asymptotic analysis techniques like Big-Oh, Big-Omega, and Theta notations are explained through examples of common functions and their orders of growth.

    Original Description:

    jl

    Original Title

    ch one part 1

    Copyright

    © © All Rights Reserved

    Available Formats

    PPTX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document discusses algorithms, including their characteristics, design paradigms like brute force, divide and conquer, and greedy paradigms. It also covers algorithm analysis concepts such as measuring efficiency through empirical and machine independent methods. Types of complexity analysis are examined like best, worst, average cases. Asymptotic analysis techniques like Big-Oh, Big-Omega, and Theta notations are explained through examples of common functions and their orders of growth.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pptx, pdf, or txt
    4 views52 pages

    CH One Part 1

    Uploaded by

    gadisa Ararsa
    This document discusses algorithms, including their characteristics, design paradigms like brute force, divide and conquer, and greedy paradigms. It also covers algorithm analysis concepts such as measuring efficiency through empirical and machine independent methods. Types of complexity analysis are examined like best, worst, average cases. Asymptotic analysis techniques like Big-Oh, Big-Omega, and Theta notations are explained through examples of common functions and their orders of growth.

    Copyright:

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

    Bule Hora University

    College of Informatics
    Computer science & engineering Department
    Chapter 1
    Introduction
    Characteristics of an Algorithm
    …
    Advantage and disadvantages of Algorithms:
    Algorithm design paradigms
    Brute force paradigm
    Divide and conquer paradigm
    Backtracking paradigm
    …
    Greedy paradigm
    Example …
    Dynamic programming paradigm
    …
    …
    Discussion time (5 min)
    Paradigm choice
    Writing an algorithm
    …
    Algorithm Analysis Concepts
    Reasons to perform analyze algorithms
    How to Measure Efficiency/performance?
    Drawbacks of empirical methods
    Machine independent analysis
    …
    …
    Examples: Count of Basic Operations T(n)
    Formal Approach to Analysis
    …
    …
    Exercises
    Types of Algorithm complexity analysis
    Best, Worst and Average Cases
    Order of Growth and Asymptotic Analysis
    Growth rates
    Rate of Growth
    Visualizing Orders of Growth
    Asymptotic analysis
    …
    Big-Oh Notation
    …
    Examples
    Order of common functions
    Implication of Big-Oh notation
    Big-Omega Notation
    Theta Notation
    More notations

    You might also like