deploy: 5549494f67

assets/js/08dfa3a2.0462ec4c.js

@@ -0,0 +1 @@
+"use strict";(self.webpackChunkfi=self.webpackChunkfi||[]).push([[2606],{32412:a=>{a.exports=JSON.parse('{"label":"astar","permalink":"/algorithms/tags/astar","allTagsPath":"/algorithms/tags","count":1,"items":[{"id":"paths/2024-01-01-bf-to-astar/astar","title":"A* algorithm","description":"Moving from Dijkstra\'s algorithm into the A* algorithm.\\n","permalink":"/algorithms/paths/bf-to-astar/astar"}],"unlisted":false}')}}]);

assets/js/2af5d0a7.928c2eb4.js

@@ -0,0 +1 @@
+"use strict";(self.webpackChunkfi=self.webpackChunkfi||[]).push([[3979],{53703:t=>{t.exports=JSON.parse('{"label":"a star","permalink":"/algorithms/tags/a-star","allTagsPath":"/algorithms/tags","count":1,"items":[{"id":"paths/2024-01-01-bf-to-astar/index","title":"From BF to A*","description":"Figuring out shortest-path problem from the BF to the A* algorithm.\\n","permalink":"/algorithms/paths/bf-to-astar"}],"unlisted":false}')}}]);

assets/js/2fcf0558.14a64e69.js

@@ -1 +0,0 @@
-"use strict";(self.webpackChunkfi=self.webpackChunkfi||[]).push([[4638],{69470:e=>{e.exports=JSON.parse('{"title":"Hash Tables","description":"Materials related to hash tables.\\n","slug":"/category/hash-tables","permalink":"/algorithms/category/hash-tables","navigation":{"previous":{"title":"Distance boundaries from BFS tree on undirected graphs","permalink":"/algorithms/graphs/bfs-tree"},"next":{"title":"Breaking Hash Table","permalink":"/algorithms/hash-tables/breaking"}}}')}}]);

assets/js/2fcf0558.a6f753b6.js

@@ -0,0 +1 @@
+"use strict";(self.webpackChunkfi=self.webpackChunkfi||[]).push([[4638],{69470:a=>{a.exports=JSON.parse('{"title":"Hash Tables","description":"Materials related to hash tables.\\n","slug":"/category/hash-tables","permalink":"/algorithms/category/hash-tables","navigation":{"previous":{"title":"A* algorithm","permalink":"/algorithms/paths/bf-to-astar/astar"},"next":{"title":"Breaking Hash Table","permalink":"/algorithms/hash-tables/breaking"}}}')}}]);

assets/js/3d92ba6e.e64b02a7.js

@@ -0,0 +1 @@
+"use strict";(self.webpackChunkfi=self.webpackChunkfi||[]).push([[8236],{77778:t=>{t.exports=JSON.parse('{"label":"dijkstra","permalink":"/algorithms/tags/dijkstra","allTagsPath":"/algorithms/tags","count":2,"items":[{"id":"paths/2024-01-01-bf-to-astar/dijkstra","title":"Dijkstra\'s algorithm","description":"Moving from Bellman-Ford into the Dijsktra\'s algorithm.\\n","permalink":"/algorithms/paths/bf-to-astar/dijkstra"},{"id":"paths/2024-01-01-bf-to-astar/index","title":"From BF to A*","description":"Figuring out shortest-path problem from the BF to the A* algorithm.\\n","permalink":"/algorithms/paths/bf-to-astar"}],"unlisted":false}')}}]);

assets/js/520f8175.85515c7b.js

@@ -1 +0,0 @@
-"use strict";(self.webpackChunkfi=self.webpackChunkfi||[]).push([[8058],{24353:t=>{t.exports=JSON.parse('{"label":"cpp","permalink":"/algorithms/tags/cpp","allTagsPath":"/algorithms/tags","count":3,"items":[{"id":"hash-tables/2023-11-28-breaking/breaking","title":"Breaking Hash Table","description":"How to get the linear time complexity in a hash table.\\n","permalink":"/algorithms/hash-tables/breaking"},{"id":"hash-tables/2023-11-28-breaking/python","title":"Breaking Python","description":"Actually getting the worst-case time complexity in Python.\\n","permalink":"/algorithms/hash-tables/breaking/python"},{"id":"hash-tables/2023-11-28-breaking/mitigations","title":"Possible Mitigations","description":"Talking about the ways how to prevent the attacks on the hash table.\\n","permalink":"/algorithms/hash-tables/breaking/mitigations"}],"unlisted":false}')}}]);

assets/js/520f8175.d9b4c84f.js

@@ -0,0 +1 @@
+"use strict";(self.webpackChunkfi=self.webpackChunkfi||[]).push([[8058],{24353:t=>{t.exports=JSON.parse('{"label":"cpp","permalink":"/algorithms/tags/cpp","allTagsPath":"/algorithms/tags","count":7,"items":[{"id":"paths/2024-01-01-bf-to-astar/astar","title":"A* algorithm","description":"Moving from Dijkstra\'s algorithm into the A* algorithm.\\n","permalink":"/algorithms/paths/bf-to-astar/astar"},{"id":"paths/2024-01-01-bf-to-astar/bf","title":"BF","description":"Solving the shortest path problem with a na\xefve approach that turns into\\nsomething.\\n","permalink":"/algorithms/paths/bf-to-astar/bf"},{"id":"hash-tables/2023-11-28-breaking/breaking","title":"Breaking Hash Table","description":"How to get the linear time complexity in a hash table.\\n","permalink":"/algorithms/hash-tables/breaking"},{"id":"hash-tables/2023-11-28-breaking/python","title":"Breaking Python","description":"Actually getting the worst-case time complexity in Python.\\n","permalink":"/algorithms/hash-tables/breaking/python"},{"id":"paths/2024-01-01-bf-to-astar/dijkstra","title":"Dijkstra\'s algorithm","description":"Moving from Bellman-Ford into the Dijsktra\'s algorithm.\\n","permalink":"/algorithms/paths/bf-to-astar/dijkstra"},{"id":"paths/2024-01-01-bf-to-astar/index","title":"From BF to A*","description":"Figuring out shortest-path problem from the BF to the A* algorithm.\\n","permalink":"/algorithms/paths/bf-to-astar"},{"id":"hash-tables/2023-11-28-breaking/mitigations","title":"Possible Mitigations","description":"Talking about the ways how to prevent the attacks on the hash table.\\n","permalink":"/algorithms/hash-tables/breaking/mitigations"}],"unlisted":false}')}}]);

assets/js/5c15401e.e4b1c753.js

@@ -0,0 +1 @@
+"use strict";(self.webpackChunkfi=self.webpackChunkfi||[]).push([[9579],{43761:t=>{t.exports=JSON.parse('{"label":"bellman ford","permalink":"/algorithms/tags/bellman-ford","allTagsPath":"/algorithms/tags","count":2,"items":[{"id":"paths/2024-01-01-bf-to-astar/bf","title":"BF","description":"Solving the shortest path problem with a na\xefve approach that turns into\\nsomething.\\n","permalink":"/algorithms/paths/bf-to-astar/bf"},{"id":"paths/2024-01-01-bf-to-astar/index","title":"From BF to A*","description":"Figuring out shortest-path problem from the BF to the A* algorithm.\\n","permalink":"/algorithms/paths/bf-to-astar"}],"unlisted":false}')}}]);

assets/js/7052c0bc.54d577f1.js

@@ -0,0 +1 @@
+"use strict";(self.webpackChunkfi=self.webpackChunkfi||[]).push([[9731],{42286:(t,e,n)=>{n.r(e),n.d(e,{assets:()=>s,contentTitle:()=>c,default:()=>d,frontMatter:()=>i,metadata:()=>a,toc:()=>p});var o=n(85893),r=n(11151);const i={id:"cpp-intro",title:"Introduction",slug:"/"},c=void 0,a={id:"cpp-intro",title:"Introduction",description:"",source:"@site/cpp/00-intro.md",sourceDirName:".",slug:"/",permalink:"/cpp/",draft:!1,unlisted:!1,editUrl:"https://github.com/mfocko/blog/tree/main/cpp/00-intro.md",tags:[],version:"current",lastUpdatedAt:1704291155,formattedLastUpdatedAt:"Jan 3, 2024",sidebarPosition:0,frontMatter:{id:"cpp-intro",title:"Introduction",slug:"/"},sidebar:"autogeneratedBar",next:{title:"Exceptions and RAII",permalink:"/cpp/category/exceptions-and-raii"}},s={},p=[];function u(t){return(0,o.jsx)(o.Fragment,{})}function d(t={}){const{wrapper:e}={...(0,r.a)(),...t.components};return e?(0,o.jsx)(e,{...t,children:(0,o.jsx)(u,{...t})}):u()}},11151:(t,e,n)=>{n.d(e,{Z:()=>a,a:()=>c});var o=n(67294);const r={},i=o.createContext(r);function c(t){const e=o.useContext(i);return o.useMemo((function(){return"function"==typeof t?t(e):{...e,...t}}),[e,t])}function a(t){let e;return e=t.disableParentContext?"function"==typeof t.components?t.components(r):t.components||r:c(t.components),o.createElement(i.Provider,{value:e},t.children)}}}]);

assets/js/7052c0bc.6b9d4e57.js

@@ -1 +0,0 @@
-"use strict";(self.webpackChunkfi=self.webpackChunkfi||[]).push([[9731],{42286:(t,e,n)=>{n.r(e),n.d(e,{assets:()=>a,contentTitle:()=>c,default:()=>d,frontMatter:()=>i,metadata:()=>s,toc:()=>p});var o=n(85893),r=n(11151);const i={id:"cpp-intro",title:"Introduction",slug:"/"},c=void 0,s={id:"cpp-intro",title:"Introduction",description:"",source:"@site/cpp/00-intro.md",sourceDirName:".",slug:"/",permalink:"/cpp/",draft:!1,unlisted:!1,editUrl:"https://github.com/mfocko/blog/tree/main/cpp/00-intro.md",tags:[],version:"current",lastUpdatedAt:1703979877,formattedLastUpdatedAt:"Dec 30, 2023",sidebarPosition:0,frontMatter:{id:"cpp-intro",title:"Introduction",slug:"/"},sidebar:"autogeneratedBar",next:{title:"Exceptions and RAII",permalink:"/cpp/category/exceptions-and-raii"}},a={},p=[];function u(t){return(0,o.jsx)(o.Fragment,{})}function d(t={}){const{wrapper:e}={...(0,r.a)(),...t.components};return e?(0,o.jsx)(e,{...t,children:(0,o.jsx)(u,{...t})}):u()}},11151:(t,e,n)=>{n.d(e,{Z:()=>s,a:()=>c});var o=n(67294);const r={},i=o.createContext(r);function c(t){const e=o.useContext(i);return o.useMemo((function(){return"function"==typeof t?t(e):{...e,...t}}),[e,t])}function s(t){let e;return e=t.disableParentContext?"function"==typeof t.components?t.components(r):t.components||r:c(t.components),o.createElement(i.Provider,{value:e},t.children)}}}]);

assets/js/794ef108.5b256546.js

@@ -0,0 +1 @@
+"use strict";(self.webpackChunkfi=self.webpackChunkfi||[]).push([[3803],{86427:(t,e,n)=>{n.r(e),n.d(e,{assets:()=>a,contentTitle:()=>s,default:()=>l,frontMatter:()=>i,metadata:()=>c,toc:()=>u});var o=n(85893),r=n(11151);const i={id:"c-intro",title:"Introduction",slug:"/"},s=void 0,c={id:"c-intro",title:"Introduction",description:"",source:"@site/c/00-intro.md",sourceDirName:".",slug:"/",permalink:"/c/",draft:!1,unlisted:!1,editUrl:"https://github.com/mfocko/blog/tree/main/c/00-intro.md",tags:[],version:"current",lastUpdatedAt:1704291155,formattedLastUpdatedAt:"Jan 3, 2024",sidebarPosition:0,frontMatter:{id:"c-intro",title:"Introduction",slug:"/"},sidebar:"autogeneratedBar",next:{title:"Bonuses",permalink:"/c/category/bonuses"}},a={},u=[];function d(t){return(0,o.jsx)(o.Fragment,{})}function l(t={}){const{wrapper:e}={...(0,r.a)(),...t.components};return e?(0,o.jsx)(e,{...t,children:(0,o.jsx)(d,{...t})}):d()}},11151:(t,e,n)=>{n.d(e,{Z:()=>c,a:()=>s});var o=n(67294);const r={},i=o.createContext(r);function s(t){const e=o.useContext(i);return o.useMemo((function(){return"function"==typeof t?t(e):{...e,...t}}),[e,t])}function c(t){let e;return e=t.disableParentContext?"function"==typeof t.components?t.components(r):t.components||r:s(t.components),o.createElement(i.Provider,{value:e},t.children)}}}]);

assets/js/794ef108.9378da0c.js

@@ -1 +0,0 @@
-"use strict";(self.webpackChunkfi=self.webpackChunkfi||[]).push([[3803],{86427:(t,e,n)=>{n.r(e),n.d(e,{assets:()=>a,contentTitle:()=>c,default:()=>l,frontMatter:()=>i,metadata:()=>s,toc:()=>u});var o=n(85893),r=n(11151);const i={id:"c-intro",title:"Introduction",slug:"/"},c=void 0,s={id:"c-intro",title:"Introduction",description:"",source:"@site/c/00-intro.md",sourceDirName:".",slug:"/",permalink:"/c/",draft:!1,unlisted:!1,editUrl:"https://github.com/mfocko/blog/tree/main/c/00-intro.md",tags:[],version:"current",lastUpdatedAt:1703979877,formattedLastUpdatedAt:"Dec 30, 2023",sidebarPosition:0,frontMatter:{id:"c-intro",title:"Introduction",slug:"/"},sidebar:"autogeneratedBar",next:{title:"Bonuses",permalink:"/c/category/bonuses"}},a={},u=[];function d(t){return(0,o.jsx)(o.Fragment,{})}function l(t={}){const{wrapper:e}={...(0,r.a)(),...t.components};return e?(0,o.jsx)(e,{...t,children:(0,o.jsx)(d,{...t})}):d()}},11151:(t,e,n)=>{n.d(e,{Z:()=>s,a:()=>c});var o=n(67294);const r={},i=o.createContext(r);function c(t){const e=o.useContext(i);return o.useMemo((function(){return"function"==typeof t?t(e):{...e,...t}}),[e,t])}function s(t){let e;return e=t.disableParentContext?"function"==typeof t.components?t.components(r):t.components||r:c(t.components),o.createElement(i.Provider,{value:e},t.children)}}}]);

assets/js/84d1e0d8.a5a56acc.js

@@ -1 +0,0 @@
-"use strict";(self.webpackChunkfi=self.webpackChunkfi||[]).push([[1885],{49713:(t,e,n)=>{n.r(e),n.d(e,{assets:()=>c,contentTitle:()=>i,default:()=>u,frontMatter:()=>r,metadata:()=>a,toc:()=>d});var o=n(85893),s=n(11151);const r={id:"algorithms-intro",title:"Introduction",slug:"/"},i=void 0,a={id:"algorithms-intro",title:"Introduction",description:"In this part you can find \u201crandom\u201d additional materials I have written over the",source:"@site/algorithms/00-intro.md",sourceDirName:".",slug:"/",permalink:"/algorithms/",draft:!1,unlisted:!1,editUrl:"https://github.com/mfocko/blog/tree/main/algorithms/00-intro.md",tags:[],version:"current",lastUpdatedAt:1703979877,formattedLastUpdatedAt:"Dec 30, 2023",sidebarPosition:0,frontMatter:{id:"algorithms-intro",title:"Introduction",slug:"/"},sidebar:"autogeneratedBar",next:{title:"Algorithms and Correctness",permalink:"/algorithms/category/algorithms-and-correctness"}},c={},d=[];function l(t){const e={a:"a",em:"em",p:"p",...(0,s.a)(),...t.components};return(0,o.jsxs)(o.Fragment,{children:[(0,o.jsxs)(e.p,{children:["In this part you can find \u201crandom\u201d additional materials I have written over the\ncourse of teaching ",(0,o.jsx)(e.em,{children:"Algorithms and data structures I"}),"."]}),"\n",(0,o.jsx)(e.p,{children:"It is a various mix of stuff that may have been produced as a follow-up on some\nquestion asked at the seminar or spontanously."}),"\n",(0,o.jsxs)(e.p,{children:["If you have some ideas for posts, please do not hesitate to submit them as issues\nin the linked ",(0,o.jsx)(e.a,{href:"https://gitlab.fi.muni.cz/xfocko/kb/issues",children:"GitLab"}),"."]})]})}function u(t={}){const{wrapper:e}={...(0,s.a)(),...t.components};return e?(0,o.jsx)(e,{...t,children:(0,o.jsx)(l,{...t})}):l(t)}},11151:(t,e,n)=>{n.d(e,{Z:()=>a,a:()=>i});var o=n(67294);const s={},r=o.createContext(s);function i(t){const e=o.useContext(r);return o.useMemo((function(){return"function"==typeof t?t(e):{...e,...t}}),[e,t])}function a(t){let e;return e=t.disableParentContext?"function"==typeof t.components?t.components(s):t.components||s:i(t.components),o.createElement(r.Provider,{value:e},t.children)}}}]);

assets/js/84d1e0d8.e078634a.js

@@ -0,0 +1 @@
+"use strict";(self.webpackChunkfi=self.webpackChunkfi||[]).push([[1885],{49713:(t,e,n)=>{n.r(e),n.d(e,{assets:()=>c,contentTitle:()=>i,default:()=>u,frontMatter:()=>r,metadata:()=>a,toc:()=>d});var o=n(85893),s=n(11151);const r={id:"algorithms-intro",title:"Introduction",slug:"/"},i=void 0,a={id:"algorithms-intro",title:"Introduction",description:"In this part you can find \u201crandom\u201d additional materials I have written over the",source:"@site/algorithms/00-intro.md",sourceDirName:".",slug:"/",permalink:"/algorithms/",draft:!1,unlisted:!1,editUrl:"https://github.com/mfocko/blog/tree/main/algorithms/00-intro.md",tags:[],version:"current",lastUpdatedAt:1704291155,formattedLastUpdatedAt:"Jan 3, 2024",sidebarPosition:0,frontMatter:{id:"algorithms-intro",title:"Introduction",slug:"/"},sidebar:"autogeneratedBar",next:{title:"Algorithms and Correctness",permalink:"/algorithms/category/algorithms-and-correctness"}},c={},d=[];function l(t){const e={a:"a",em:"em",p:"p",...(0,s.a)(),...t.components};return(0,o.jsxs)(o.Fragment,{children:[(0,o.jsxs)(e.p,{children:["In this part you can find \u201crandom\u201d additional materials I have written over the\ncourse of teaching ",(0,o.jsx)(e.em,{children:"Algorithms and data structures I"}),"."]}),"\n",(0,o.jsx)(e.p,{children:"It is a various mix of stuff that may have been produced as a follow-up on some\nquestion asked at the seminar or spontanously."}),"\n",(0,o.jsxs)(e.p,{children:["If you have some ideas for posts, please do not hesitate to submit them as issues\nin the linked ",(0,o.jsx)(e.a,{href:"https://gitlab.fi.muni.cz/xfocko/kb/issues",children:"GitLab"}),"."]})]})}function u(t={}){const{wrapper:e}={...(0,s.a)(),...t.components};return e?(0,o.jsx)(e,{...t,children:(0,o.jsx)(l,{...t})}):l(t)}},11151:(t,e,n)=>{n.d(e,{Z:()=>a,a:()=>i});var o=n(67294);const s={},r=o.createContext(s);function i(t){const e=o.useContext(r);return o.useMemo((function(){return"function"==typeof t?t(e):{...e,...t}}),[e,t])}function a(t){let e;return e=t.disableParentContext?"function"==typeof t.components?t.components(s):t.components||s:i(t.components),o.createElement(r.Provider,{value:e},t.children)}}}]);

assets/js/97a42631.7eff63e9.js

@@ -0,0 +1 @@
+"use strict";(self.webpackChunkfi=self.webpackChunkfi||[]).push([[1464],{77343:a=>{a.exports=JSON.parse('[{"label":"python","permalink":"/algorithms/tags/python","count":7},{"label":"testing","permalink":"/algorithms/tags/testing","count":1},{"label":"postconditions","permalink":"/algorithms/tags/postconditions","count":1},{"label":"sorting","permalink":"/algorithms/tags/sorting","count":1},{"label":"graphs","permalink":"/algorithms/tags/graphs","count":2},{"label":"bfs","permalink":"/algorithms/tags/bfs","count":1},{"label":"csharp","permalink":"/algorithms/tags/csharp","count":1},{"label":"iterators","permalink":"/algorithms/tags/iterators","count":1},{"label":"iterative","permalink":"/algorithms/tags/iterative","count":1},{"label":"cpp","permalink":"/algorithms/tags/cpp","count":7},{"label":"hash-tables","permalink":"/algorithms/tags/hash-tables","count":3},{"label":"dynamic programming","permalink":"/algorithms/tags/dynamic-programming","count":7},{"label":"astar","permalink":"/algorithms/tags/astar","count":1},{"label":"brute force","permalink":"/algorithms/tags/brute-force","count":2},{"label":"bellman ford","permalink":"/algorithms/tags/bellman-ford","count":2},{"label":"greedy","permalink":"/algorithms/tags/greedy","count":4},{"label":"dijkstra","permalink":"/algorithms/tags/dijkstra","count":2},{"label":"a star","permalink":"/algorithms/tags/a-star","count":1},{"label":"balanced trees","permalink":"/algorithms/tags/balanced-trees","count":2},{"label":"red-black trees","permalink":"/algorithms/tags/red-black-trees","count":2},{"label":"applications","permalink":"/algorithms/tags/applications","count":1},{"label":"karel","permalink":"/algorithms/tags/karel","count":2},{"label":"recursion","permalink":"/algorithms/tags/recursion","count":5},{"label":"backtracking","permalink":"/algorithms/tags/backtracking","count":2},{"label":"solution","permalink":"/algorithms/tags/solution","count":1},{"label":"java","permalink":"/algorithms/tags/java","count":5},{"label":"bottom-up-dp","permalink":"/algorithms/tags/bottom-up-dp","count":2},{"label":"exponential","permalink":"/algorithms/tags/exponential","count":2},{"label":"top-down-dp","permalink":"/algorithms/tags/top-down-dp","count":2},{"label":"c","permalink":"/algorithms/tags/c","count":1},{"label":"dynamic array","permalink":"/algorithms/tags/dynamic-array","count":1},{"label":"time complexity","permalink":"/algorithms/tags/time-complexity","count":1}]')}}]);

assets/js/97a42631.dd58f185.js

@@ -1 +0,0 @@
-"use strict";(self.webpackChunkfi=self.webpackChunkfi||[]).push([[1464],{77343:a=>{a.exports=JSON.parse('[{"label":"python","permalink":"/algorithms/tags/python","count":7},{"label":"testing","permalink":"/algorithms/tags/testing","count":1},{"label":"postconditions","permalink":"/algorithms/tags/postconditions","count":1},{"label":"sorting","permalink":"/algorithms/tags/sorting","count":1},{"label":"graphs","permalink":"/algorithms/tags/graphs","count":2},{"label":"bfs","permalink":"/algorithms/tags/bfs","count":1},{"label":"csharp","permalink":"/algorithms/tags/csharp","count":1},{"label":"iterators","permalink":"/algorithms/tags/iterators","count":1},{"label":"iterative","permalink":"/algorithms/tags/iterative","count":1},{"label":"cpp","permalink":"/algorithms/tags/cpp","count":3},{"label":"hash-tables","permalink":"/algorithms/tags/hash-tables","count":3},{"label":"balanced trees","permalink":"/algorithms/tags/balanced-trees","count":2},{"label":"red-black trees","permalink":"/algorithms/tags/red-black-trees","count":2},{"label":"applications","permalink":"/algorithms/tags/applications","count":1},{"label":"karel","permalink":"/algorithms/tags/karel","count":2},{"label":"recursion","permalink":"/algorithms/tags/recursion","count":5},{"label":"backtracking","permalink":"/algorithms/tags/backtracking","count":2},{"label":"solution","permalink":"/algorithms/tags/solution","count":1},{"label":"java","permalink":"/algorithms/tags/java","count":5},{"label":"dynamic-programming","permalink":"/algorithms/tags/dynamic-programming","count":3},{"label":"bottom-up-dp","permalink":"/algorithms/tags/bottom-up-dp","count":2},{"label":"greedy","permalink":"/algorithms/tags/greedy","count":2},{"label":"exponential","permalink":"/algorithms/tags/exponential","count":2},{"label":"top-down-dp","permalink":"/algorithms/tags/top-down-dp","count":2},{"label":"c","permalink":"/algorithms/tags/c","count":1},{"label":"dynamic array","permalink":"/algorithms/tags/dynamic-array","count":1},{"label":"time complexity","permalink":"/algorithms/tags/time-complexity","count":1}]')}}]);

assets/js/a2ba8888.ab09cb54.js

@@ -0,0 +1 @@
+"use strict";(self.webpackChunkfi=self.webpackChunkfi||[]).push([[8289],{55941:t=>{t.exports=JSON.parse('{"label":"brute force","permalink":"/algorithms/tags/brute-force","allTagsPath":"/algorithms/tags","count":2,"items":[{"id":"paths/2024-01-01-bf-to-astar/bf","title":"BF","description":"Solving the shortest path problem with a na\xefve approach that turns into\\nsomething.\\n","permalink":"/algorithms/paths/bf-to-astar/bf"},{"id":"paths/2024-01-01-bf-to-astar/index","title":"From BF to A*","description":"Figuring out shortest-path problem from the BF to the A* algorithm.\\n","permalink":"/algorithms/paths/bf-to-astar"}],"unlisted":false}')}}]);

assets/js/b8cbf382.6ba7c9a6.js

@@ -1 +0,0 @@
-"use strict";(self.webpackChunkfi=self.webpackChunkfi||[]).push([[7438],{74632:e=>{e.exports=JSON.parse('{"label":"greedy","permalink":"/algorithms/tags/greedy","allTagsPath":"/algorithms/tags","count":2,"items":[{"id":"recursion/2023-08-17-pyramid-slide-down/greedy","title":"Greedy solution","description":"Greedy solution of the Pyramid Slide Down.\\n","permalink":"/algorithms/recursion/pyramid-slide-down/greedy"},{"id":"recursion/2023-08-17-pyramid-slide-down/pyramid-slide-down","title":"Introduction to dynamic programming","description":"Solving a problem in different ways.\\n","permalink":"/algorithms/recursion/pyramid-slide-down"}],"unlisted":false}')}}]);

assets/js/b8cbf382.e3b79fad.js

@@ -0,0 +1 @@
+"use strict";(self.webpackChunkfi=self.webpackChunkfi||[]).push([[7438],{74632:i=>{i.exports=JSON.parse('{"label":"greedy","permalink":"/algorithms/tags/greedy","allTagsPath":"/algorithms/tags","count":4,"items":[{"id":"paths/2024-01-01-bf-to-astar/dijkstra","title":"Dijkstra\'s algorithm","description":"Moving from Bellman-Ford into the Dijsktra\'s algorithm.\\n","permalink":"/algorithms/paths/bf-to-astar/dijkstra"},{"id":"paths/2024-01-01-bf-to-astar/index","title":"From BF to A*","description":"Figuring out shortest-path problem from the BF to the A* algorithm.\\n","permalink":"/algorithms/paths/bf-to-astar"},{"id":"recursion/2023-08-17-pyramid-slide-down/greedy","title":"Greedy solution","description":"Greedy solution of the Pyramid Slide Down.\\n","permalink":"/algorithms/recursion/pyramid-slide-down/greedy"},{"id":"recursion/2023-08-17-pyramid-slide-down/pyramid-slide-down","title":"Introduction to dynamic programming","description":"Solving a problem in different ways.\\n","permalink":"/algorithms/recursion/pyramid-slide-down"}],"unlisted":false}')}}]);

assets/js/dd841e73.afb9a531.js

@@ -1 +0,0 @@
-"use strict";(self.webpackChunkfi=self.webpackChunkfi||[]).push([[2482],{40155:i=>{i.exports=JSON.parse('{"label":"dynamic-programming","permalink":"/algorithms/tags/dynamic-programming","allTagsPath":"/algorithms/tags","count":3,"items":[{"id":"recursion/2023-08-17-pyramid-slide-down/bottom-up-dp","title":"Bottom-up DP solution","description":"Bottom-up DP solution of the Pyramid Slide Down.\\n","permalink":"/algorithms/recursion/pyramid-slide-down/bottom-up-dp"},{"id":"recursion/2023-08-17-pyramid-slide-down/pyramid-slide-down","title":"Introduction to dynamic programming","description":"Solving a problem in different ways.\\n","permalink":"/algorithms/recursion/pyramid-slide-down"},{"id":"recursion/2023-08-17-pyramid-slide-down/top-down-dp","title":"Top-down DP solution","description":"Top-down DP solution of the Pyramid Slide Down.\\n","permalink":"/algorithms/recursion/pyramid-slide-down/top-down-dp"}],"unlisted":false}')}}]);

assets/js/dd841e73.c1ec5d72.js

@@ -0,0 +1 @@
+"use strict";(self.webpackChunkfi=self.webpackChunkfi||[]).push([[2482],{40155:t=>{t.exports=JSON.parse('{"label":"dynamic programming","permalink":"/algorithms/tags/dynamic-programming","allTagsPath":"/algorithms/tags","count":7,"items":[{"id":"paths/2024-01-01-bf-to-astar/astar","title":"A* algorithm","description":"Moving from Dijkstra\'s algorithm into the A* algorithm.\\n","permalink":"/algorithms/paths/bf-to-astar/astar"},{"id":"paths/2024-01-01-bf-to-astar/bf","title":"BF","description":"Solving the shortest path problem with a na\xefve approach that turns into\\nsomething.\\n","permalink":"/algorithms/paths/bf-to-astar/bf"},{"id":"recursion/2023-08-17-pyramid-slide-down/bottom-up-dp","title":"Bottom-up DP solution","description":"Bottom-up DP solution of the Pyramid Slide Down.\\n","permalink":"/algorithms/recursion/pyramid-slide-down/bottom-up-dp"},{"id":"paths/2024-01-01-bf-to-astar/dijkstra","title":"Dijkstra\'s algorithm","description":"Moving from Bellman-Ford into the Dijsktra\'s algorithm.\\n","permalink":"/algorithms/paths/bf-to-astar/dijkstra"},{"id":"paths/2024-01-01-bf-to-astar/index","title":"From BF to A*","description":"Figuring out shortest-path problem from the BF to the A* algorithm.\\n","permalink":"/algorithms/paths/bf-to-astar"},{"id":"recursion/2023-08-17-pyramid-slide-down/pyramid-slide-down","title":"Introduction to dynamic programming","description":"Solving a problem in different ways.\\n","permalink":"/algorithms/recursion/pyramid-slide-down"},{"id":"recursion/2023-08-17-pyramid-slide-down/top-down-dp","title":"Top-down DP solution","description":"Top-down DP solution of the Pyramid Slide Down.\\n","permalink":"/algorithms/recursion/pyramid-slide-down/top-down-dp"}],"unlisted":false}')}}]);

assets/js/df078f58.4f109cb4.js

@@ -0,0 +1 @@
+"use strict";(self.webpackChunkfi=self.webpackChunkfi||[]).push([[7743],{88298:t=>{t.exports=JSON.parse('{"title":"Paths in Graphs","description":"Materials related to finding paths in graphs.\\n","slug":"/category/paths-in-graphs","permalink":"/algorithms/category/paths-in-graphs","navigation":{"previous":{"title":"Distance boundaries from BFS tree on undirected graphs","permalink":"/algorithms/graphs/bfs-tree"},"next":{"title":"From BF to A*","permalink":"/algorithms/paths/bf-to-astar"}}}')}}]);