Computational Complexity Theoretical Foundation on How Long Will Program Run
Offered By: EuroPython Conference via YouTube
Course Description
Overview
Explore the theoretical foundations of computational complexity in this enlightening talk from EuroPython 2021. Delve into the concept of time complexity, learning how to formally measure and analyze the execution time of programs and algorithms. Discover the significance of Big-O, Big-θ, and Big-Ω notations in complexity analysis, and examine their practical applications through examples of searching and sorting algorithms. Gain valuable insights into how algorithm design choices impact program execution time, drawing inspiration from the youngest Guinness World Record holder for computer programming.
Syllabus
Kautilya Katariya - Computational Complexity Theoretical Foundation on How Long Will Program Run
Taught by
EuroPython Conference
Related Courses
Automata TheoryStanford University via edX Introduction to Computational Thinking and Data Science
Massachusetts Institute of Technology via edX 算法设计与分析 Design and Analysis of Algorithms
Peking University via Coursera How to Win Coding Competitions: Secrets of Champions
ITMO University via edX Introdução à Ciência da Computação com Python Parte 2
Universidade de São Paulo via Coursera