Scribd
Upload
676 views34 pages

Fundamentals of Algorithms - CS502 Power Point Slides Lecture 07

This document is a lecture on algorithms that discusses asymptotic notation and examples of using O-notation to analyze algorithms. It covers the limit rules for asymptotic notation and provides examples of applying asymptotic intuition. A significant portion of the lecture focuses on the divide and conquer strategy and uses merge sort as a case study to illustrate how to analyze the runtime of a divide and conquer algorithm using asymptotic notation.

Uploaded by

Web Guru
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
676 views34 pages

Fundamentals of Algorithms - CS502 Power Point Slides Lecture 07

This document is a lecture on algorithms that discusses asymptotic notation and examples of using O-notation to analyze algorithms. It covers the limit rules for asymptotic notation and provides examples of applying asymptotic intuition. A significant portion of the lecture focuses on the divide and conquer strategy and uses merge sort as a case study to illustrate how to analyze the runtime of a divide and conquer algorithm using asymptotic notation.

Uploaded by

Web Guru
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd

Algorithms

Lecture #07

[Link] Aslam
Asymptotic Notation - Example
Asymptotic Notation - Example
Asymptotic Notation - Example
Asymptotic Notation - Example
Asymptotic Notation - Example
Asymptotic Notation - Example
Asymptotic Notation - Example
Asymptotic Notation - Example
O-Notation…
O-Notation (Big O)
Notation
Notation
Limit Rule
Limit Rule
Limit Rule
Asymptotic Intuition
Asymptotic Intuition
Asymptotic Intuition
Divide and Conquer
Merge Sort
Merge Sort
Merge Sort
Merge Sort
Merge Sort
Merge Sort
Divide and Conquer Strategy
Merge Sort
Merge Sort
Merge Sort
Limit Rule
Merge Sort
Design
and
Analysis of Algorithm

You might also like