Scribd Logo
Upload

Welcome to Scribd!

  • Algorithmes - Lecture 2

    Uploaded by

    احمد الحاسي
    8 views14 pages
    This document is a lecture on analyzing algorithmic growth and efficiency. It introduces asymptotic notation to describe functions and running times, compares different functions, and covers properties of asymptotic notation. The lecture outlines include asymptotic notation, functions, and running times, comparing functions, and properties of asymptotic notation. It aims to teach students how to evaluate and compare algorithms based on how their running times grow relative to input size.

    Original Description:

    algorithms

    Original Title

    Algorithmes_Lecture 2

    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
    This document is a lecture on analyzing algorithmic growth and efficiency. It introduces asymptotic notation to describe functions and running times, compares different functions, and covers properties of asymptotic notation. The lecture outlines include asymptotic notation, functions, and running times, comparing functions, and properties of asymptotic notation. It aims to teach students how to evaluate and compare algorithms based on how their running times grow relative to input size.

    Copyright:

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

    Algorithmes - Lecture 2

    Uploaded by

    احمد الحاسي
    This document is a lecture on analyzing algorithmic growth and efficiency. It introduces asymptotic notation to describe functions and running times, compares different functions, and covers properties of asymptotic notation. The lecture outlines include asymptotic notation, functions, and running times, comparing functions, and properties of asymptotic notation. It aims to teach students how to evaluate and compare algorithms based on how their running times grow relative to input size.

    Copyright:

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

    Introduction to Algorithms

    Growth of Functions
    Lecture 2
    Dr. Tahani Almabruk
    Assist. Professor, Computer Science Dept.
    Omar Almukhtar University
    Outlines

    ❖ Asymptotic notation, functions, and running times t


    ❖ ime
    ❖ Comparing Functions

    ❖ Properties of Asymptotic Notation


    Asymptotic notation, functions, and running times
    Asymptotic notation, functions, and running times
    Asymptotic notation, functions, and running times
    Asymptotic notation, functions, and running times
    Asymptotic notation, functions, and running times
    Asymptotic notation, functions, and running times
    Properties of Asymptotic Notation
    Properties of Asymptotic Notation
    Properties of Asymptotic Notation
    Properties of Asymptotic Notation
    Growth of Functions
    Any Questions?

    You might also like