YoVDO

Computational Complexity Theoretical Foundation on How Long Will Program Run

Offered By: EuroPython Conference via YouTube

Tags

EuroPython Courses Sorting Algorithms Courses Searching Algorithms Courses Computational Complexity Courses Big O Notation Courses Time Complexity Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
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

Algorithmic Thinking (Part 1)
Rice University via Coursera Algorithmic Thinking (Part 2)
Rice University via Coursera Data Structures and Performance
University of California, San Diego via Coursera Calculus: Single Variable Part 1 - Functions
University of Pennsylvania via Coursera Calculus: Single Variable Part 3 - Integration
University of Pennsylvania via Coursera