JCL

FEUP/DEI & INESC TEC

User Tools

Site Tools


teach:fpro:lectures:20

LE20: 07/01/2021

Master in Informatics and Computing Engineering
Programming Fundamentals
Instance: 2020/2021


Lecture #20 :: 07/01/2021

Goals

By the end of this class, the student should be able to:

  • Describe why algorithm analysis is important
  • Use “Big-O” to describe execution time
  • Describe the “Big-O” execution time of common operations on Python lists and dictionaries

Content

  • What is Algorithm analysis
    • Order of growth
    • Big-O notation
  • Performance of Python data structures
    • Lists
    • Dictionaries

Bibliography

  • Allen Downey, Think Python — How to Think Like a Computer Scientist, 2nd Edition, Version 2.4.0, Green Tea Press, 2015 HTML (Annex B)

Materials

Summary

  • What is Algorithm analysis. Order of growth. Big-O notation. Performance of Python data structures: Lists, Dictionaries.

FPRO, 2020/21

« Previous | Index | Next »

teach/fpro/lectures/20.txt · Last modified: 03/01/2021 17:44 by Correia Lopes