From 14181ca512823e7ccee94e298af53dc6c84b9f97 Mon Sep 17 00:00:00 2001 From: Dong-geon Lee Date: Sat, 23 Sep 2023 14:14:14 +0900 Subject: [PATCH] fix ToC 2 --- .../01. Algorithm Complexity Analysis/README.md | 10 +++++----- 1 file changed, 5 insertions(+), 5 deletions(-) diff --git a/3. Algorithms/01. Algorithm Complexity Analysis/README.md b/3. Algorithms/01. Algorithm Complexity Analysis/README.md index 26301360..5fa8c5db 100644 --- a/3. Algorithms/01. Algorithm Complexity Analysis/README.md +++ b/3. Algorithms/01. Algorithm Complexity Analysis/README.md @@ -1,19 +1,19 @@ # 알고리즘과 문제해결 -- [알고리즘이란?](#알고리즘이란-) +- [알고리즘이란?](#알고리즘이란) - [성능 분석](#성능-분석) - * [공간 복잡도 (space complexity)](#공간-복잡도-space-complexity-) - * [시간 복잡도 (time complexity)](#시간-복잡도-time-complexity-) + * [공간 복잡도 (space complexity)](#공간-복잡도-space-complexity) + * [시간 복잡도 (time complexity)](#시간-복잡도-time-complexity) - [함수 호출의 Mechanism 7단계](#함수-호출의-mechanism-7단계) - [점근식 표기법](#점근식-표기법) - * [Big O 표기법](#big-o----) + * [Big O 표기법](#big-o-표기법) * [Asymptotic Analysis](#asymptotic-analysis) * [대표적인 복잡도 카테고리](#대표적인-복잡도-카테고리) + [Polynomial Time](#polynomial-time) + [Exponential Time](#exponential-time) * [Ω 표기법](#ω-표기법) * [Summary ✩](#summary-) -- [순환 (recursion)](#순환--recursion-) +- [순환 (recursion)](#순환-recursion) - [Master Theorem](#master-theorem) * [제약 조건 ✩](#제약-조건-) + [Adavanced Master Theorem](#adavanced-master-theorem)