1 / 9

Foundations II: Data Structures and Algorithms

Foundations II: Data Structures and Algorithms. Lecture 2 : -- More on growth of functions. Review some basics Chapter 3.2 of CLRS See the board More examples on comparing the growths of functions. Recall Asymptotic Notation. Another View. Some Special Cases.

eros
Télécharger la présentation

Foundations II: Data Structures and Algorithms

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Foundations II: Data Structures and Algorithms Lecture 2: -- More on growth of functions CSE 2331 / 5331

  2. Review some basics • Chapter 3.2 of CLRS • See the board • More examples on comparing the growths of functions CSE 2331 / 5331

  3. Recall Asymptotic Notation CSE 2331 / 5331

  4. Another View CSE 2331 / 5331

  5. Some Special Cases CSE 2331 / 5331

  6. More Examples • vs. • vs. • vs. • vs. • vs. • vs. • vs. • vs. • vs. • vs. CSE 2331 / 5331

  7. More Examples • vs. • vs. • vs. • vs. In general, we can safely ignore low order terms. CSE 2331 / 5331

  8. Hierarchy CSE 2331 / 5331

  9. More Example • Rank the following functions by order of growth: CSE 2331 / 5331

More Related