{% extends "base.html" %} {% block title %}ADA Theory | Algorithm Analyzer, Mohammed Usman{% endblock %} {% block content %}
Master Theorem, Amortized Analysis, NP-Completeness, and Asymptotic Notation.
| Notation | Name | Example | Class |
|---|---|---|---|
| {{ item.notation }} | {{ item.name }} | {{ item.example }} | {{ item.class }} |
Solves divide-and-conquer recurrences. Three cases based on comparison of f(n) and n^(log_b a).
Average cost per operation over a sequence. Dynamic arrays: O(1) amortized per insertion.
{{ cls.definition }}
| Paradigm | Approach | Examples | When to Use |
|---|---|---|---|
| {{ p.paradigm }} | {{ p.approach }} | {% for ex in p.examples %}{{ ex }}{% endfor %} | {{ p.when_to_use }} |