<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/"><channel><title>알고리즘 on History</title><link>https://kukie.tech/tags/%EC%95%8C%EA%B3%A0%EB%A6%AC%EC%A6%98/</link><description>Recent content in 알고리즘 on History</description><generator>Hugo</generator><language>ko-kr</language><lastBuildDate>Wed, 06 May 2026 09:00:00 +0900</lastBuildDate><atom:link href="https://kukie.tech/tags/%EC%95%8C%EA%B3%A0%EB%A6%AC%EC%A6%98/index.xml" rel="self" type="application/rss+xml"/><item><title>APS.10 Dijkstra, Bellman-Ford &amp; Sliding Puzzle</title><link>https://kukie.tech/posts/aps.10_dijkstra_bellmanford_slidingpuzzle/</link><pubDate>Wed, 06 May 2026 09:00:00 +0900</pubDate><guid>https://kukie.tech/posts/aps.10_dijkstra_bellmanford_slidingpuzzle/</guid><description>Shortest path algorithms (Dijkstra, Bellman-Ford) and BFS-based state-space search illustrated with the sliding puzzle problem.</description></item><item><title>APS.06 Tarjan's SCC Algorithm</title><link>https://kukie.tech/posts/aps.06_scc_tarjan/</link><pubDate>Tue, 14 Apr 2026 09:00:00 +0900</pubDate><guid>https://kukie.tech/posts/aps.06_scc_tarjan/</guid><description>How a single depth-first walk unravels every cycle in a directed graph, without ever looking back.</description></item><item><title>APS.05 RMQ, Segment Tree, Sparse Table</title><link>https://kukie.tech/posts/aps.05_graph_problems/</link><pubDate>Tue, 07 Apr 2026 09:00:00 +0900</pubDate><guid>https://kukie.tech/posts/aps.05_graph_problems/</guid><description>From range minimum query to LCA in O(1): Segment Tree, Sparse Table, and Euler tour reduction.</description></item><item><title>APS.04 String Matching</title><link>https://kukie.tech/posts/aps.04_string_matching/</link><pubDate>Wed, 25 Mar 2026 09:00:00 +0900</pubDate><guid>https://kukie.tech/posts/aps.04_string_matching/</guid><description>From naïve O(nm) to KMP O(n+m): prefix function, rolling hash, and binary search on longest repeated substring.</description></item><item><title>APS.03 Geometric Problems</title><link>https://kukie.tech/posts/aps.03_geometric_problems/</link><pubDate>Wed, 18 Mar 2026 09:00:00 +0900</pubDate><guid>https://kukie.tech/posts/aps.03_geometric_problems/</guid><description>From cross product to convex hull: a complete walkthrough of CCW, line segment intersection, and the Monotone Chain algorithm.</description></item></channel></rss>