{"type":"rich","version":"1.0","provider_name":"Transistor","provider_url":"https://transistor.fm","author_name":"The Eric Normand Podcast","title":"Is there always a way to implement an algorithm without mutable state?","html":"<iframe width=\"100%\" height=\"180\" frameborder=\"no\" scrolling=\"no\" seamless src=\"https://share.transistor.fm/e/ab8f5c28\"></iframe>","width":"100%","height":180,"duration":802,"description":"It’s tempting to use mutable state in your algorithm. It’s so convenient! And we’re so used to it, if we come from an imperative paradigm. But we must remember that there is always a way, even if it’s not immediately obvious. I go over two ways to implement an algorithm without mutable state.","thumbnail_url":"https://img.transistorcdn.com/WbyB3L00271RX0nwX_O6wfvG-9-GVuhuQNa4JxI1IvI/rs:fill:0:0:1/w:400/h:400/q:60/mb:500000/aHR0cHM6Ly9pbWct/dXBsb2FkLXByb2R1/Y3Rpb24udHJhbnNp/c3Rvci5mbS9zaG93/LzQzMzgvMTU2ODQ4/NjQ0MC1hcnR3b3Jr/LmpwZw.webp","thumbnail_width":300,"thumbnail_height":300}