"use strict";(self.webpackChunkfi=self.webpackChunkfi||[]).push([[3276],{29538:e=>{e.exports=JSON.parse('{"pluginId":"algorithms","version":"current","label":"Next","banner":null,"badge":false,"noIndex":false,"className":"docs-version-current","isLast":true,"docsSidebars":{"autogeneratedBar":[{"type":"link","label":"Introduction","href":"/algorithms/","docId":"algorithms-intro","unlisted":false},{"type":"category","label":"Algorithms and Correctness","collapsible":true,"collapsed":true,"items":[{"type":"link","label":"Vague postconditions and proving correctness of algorithms","href":"/algorithms/algorithms-correctness/postcondition-ambiguity","docId":"algorithms-correctness/postcondition-ambiguity","unlisted":false}],"href":"/algorithms/category/algorithms-and-correctness"},{"type":"category","label":"Asymptotic Notation and Time Complexity","collapsible":true,"collapsed":true,"items":[{"type":"link","label":"Time complexity of \u2039extend\u203a","href":"/algorithms/time-complexity/extend","docId":"time-complexity/extend","unlisted":false}],"href":"/algorithms/category/asymptotic-notation-and-time-complexity"},{"type":"category","label":"Recursion","collapsible":true,"collapsed":true,"items":[{"type":"category","label":"Recursion and backtracking with Robot Karel","collapsible":true,"collapsed":true,"items":[{"type":"link","label":"Solution to the problem","href":"/algorithms/recursion/karel/solution","docId":"recursion/2022-11-29-karel/solution","unlisted":false}],"href":"/algorithms/recursion/karel"},{"type":"category","label":"Introduction to dynamic programming","collapsible":true,"collapsed":true,"items":[{"type":"link","label":"Na\xefve solution","href":"/algorithms/recursion/pyramid-slide-down/naive","docId":"recursion/2023-08-17-pyramid-slide-down/naive","unlisted":false},{"type":"link","label":"Greedy solution","href":"/algorithms/recursion/pyramid-slide-down/greedy","docId":"recursion/2023-08-17-pyramid-slide-down/greedy","unlisted":false},{"type":"link","label":"Top-down DP solution","href":"/algorithms/recursion/pyramid-slide-down/top-down-dp","docId":"recursion/2023-08-17-pyramid-slide-down/top-down-dp","unlisted":false},{"type":"link","label":"Bottom-up DP solution","href":"/algorithms/recursion/pyramid-slide-down/bottom-up-dp","docId":"recursion/2023-08-17-pyramid-slide-down/bottom-up-dp","unlisted":false}],"href":"/algorithms/recursion/pyramid-slide-down"}],"href":"/algorithms/category/recursion"},{"type":"category","label":"Red-Black Trees","collapsible":true,"collapsed":true,"items":[{"type":"link","label":"Pou\u017eit\xed \u010derveno-\u010dern\xfdch strom\u016f","href":"/algorithms/rb-trees/applications","docId":"rb-trees/applications","unlisted":false},{"type":"link","label":"On the rules of the red-black tree","href":"/algorithms/rb-trees/rules","docId":"rb-trees/rules","unlisted":false}],"href":"/algorithms/category/red-black-trees"},{"type":"category","label":"Graphs","collapsible":true,"collapsed":true,"items":[{"type":"link","label":"Iterative algorithms via iterators","href":"/algorithms/graphs/iterative-and-iterators","docId":"graphs/iterative-and-iterators","unlisted":false},{"type":"link","label":"Distance boundaries from BFS tree on undirected graphs","href":"/algorithms/graphs/bfs-tree","docId":"graphs/bfs-tree","unlisted":false}],"href":"/algorithms/category/graphs"},{"type":"category","label":"Paths in Graphs","collapsible":true,"collapsed":true,"items":[{"type":"category","label":"From BF to A*","collapsible":true,"collapsed":true,"items":[{"type":"link","label":"BF","href":"/algorithms/paths/bf-to-astar/bf","docId":"paths/2024-01-01-bf-to-astar/bf","unlisted":false},{"type":"link","label":"Dijkstra\'salgorithm","href":"/algorithms/paths/bf-to-astar/dijkstra","docId":"paths/2024-01-01-bf-to-astar/dijkstra","unlisted":false},{"type":"link","label":"A*algorithm","href":"/algorithms/paths/bf-to-astar/astar","docId":"paths/2024-01-01-bf-to-astar/astar","unlisted":false}],"href":"/algorithms/paths/bf-to-astar"}],"href":"/algorithms/category/paths-in-graphs"},{"type":"category","label":"
