Semaine 2: Analyse de complexité
Objectifs
- Notation asymptotique (O, Ω, Θ)
- Analyse de cas pire, moyen, meilleur
- Récurrences
Lectures
- [Beaudry] Section 2
Exercices
$$\sum_{i=1}^n i = \frac{n(n+1)}{2}$$Auteurs
Postdoctoral Researcher in Computer Science
I am currently a postdoctoral researcher in computer science at Université
TÉLUQ, where my research focuses on speeding up the conversion of integer and
floating-point numbers into decimal strings. During my doctoral studies, I
designed algorithms and data structures that leverage modern computer
architectures to solve large instances of Markov decision processes (MDPs). In
my master’s research, I developed routing algorithms for electric vehicles
aimed at determining the optimal path between two points while minimizing
travel time (including driving, charging, and expected waiting time at
charging stations).