Algorithms Portal

date2026-07-14document_iddoc_1c97d9fd114cd30c062b19dbfc56bf3ddescriptionアルゴリズム講義を、計算量・再帰・ソート・探索・グラフアルゴリズム・データ構造の束で整理した情報工学内のポータルです。type講義statusactive

portalinformationalgorithmlecture

1Learning sequence

This portal studies algorithms—finite procedures for solving problems—from the complementary perspectives of correctness and complexity. Begin with complexity and recursion, then proceed to sorting, data structures, array search, and graph traversal.

2Foundations

data/lecture/information/algorithm/foundation/computational-complexity-basics.lecture.n.md data/lecture/information/algorithm/foundation/recursion-basics.lecture.n.md data/lecture/information/algorithm/foundation/sorting-basics.lecture.n.md

3Data Structures, Array Search, and Graph Traversal

data/lecture/information/algorithm/data-structures/data-structures-portal.lecture.n.md data/lecture/information/algorithm/search/linear-search.lecture.n.md data/lecture/information/algorithm/search/binary-search.lecture.n.md data/lecture/information/algorithm/graph/graph-algorithms-portal.lecture.n.md data/lecture/information/algorithm/search/dfs-and-bfs-basics.lecture.n.md

4Learning objectives

Distinguish an algorithm's output specification from its preconditions.
Explain correctness using invariants or induction.
Evaluate time and space complexity as functions of input size.