Blogging my journey into software engineering - articles on software engineering, design, and AI.https://angelosioak.comenhttps://angelosioak.com/articles/recursionhttps://angelosioak.com/articles/recursionA walkthrough of what recursion actually is, the three rules every recursive function has to follow, and why it can blow up your call stack if you are not careful.Wed, 23 Sep 2026 00:00:00 GMTjavascripthttps://angelosioak.com/articles/githubhttps://angelosioak.com/articles/githubA working reference for conventional commits, branch cleanup, safe rebasing, and force-pushing without breaking anything - the git I actually use.Tue, 08 Sep 2026 00:00:00 GMTgithubhttps://angelosioak.com/articles/queueshttps://angelosioak.com/articles/queuesA walkthrough of what queues are and where they quietly show up in everyday code - print queues, task runners, and breadth-first searchTue, 08 Sep 2026 00:00:00 GMTsoftware-engineeringhttps://angelosioak.com/articles/stackhttps://angelosioak.com/articles/stackA walkthrough of what stacks are and where they quietly show up in everyday code - undo buttons, browser history, and the JS call stackTue, 08 Sep 2026 00:00:00 GMTsoftware-engineeringhttps://angelosioak.com/articles/big-o-notationhttps://angelosioak.com/articles/big-o-notationTime complexity, space complexity, and growth curves - what Big O notation actually measures, and why it matters more than counting exact operations.Mon, 31 Aug 2026 00:00:00 GMTsoftware-engineeringhttps://angelosioak.com/articles/o1-constant-timehttps://angelosioak.com/articles/o1-constant-timeWhat O(1) constant time actually means, why direct access beats searching, and how to prove an algorithm's speed stays the same no matter how much data you throw at it.Mon, 31 Aug 2026 00:00:00 GMTsoftware-engineeringhttps://angelosioak.com/articles/searching-an-arrayhttps://angelosioak.com/articles/searching-an-arrayHow linear search actually works under the hood, why it costs O(n) no matter which built-in you reach for, and when sorting the data first to unlock binary search's O(log n) is worth the tradeoff.Tue, 25 Aug 2026 00:00:00 GMTsoftware-engineeringhttps://angelosioak.com/articles/arrayshttps://angelosioak.com/articles/arraysWhich array operations are cheap and which aren't - why push and pop are O(1), search is O(n), and adding to the front or middle means shifting every element after it.Fri, 21 Aug 2026 00:00:00 GMTsoftware-engineeringhttps://angelosioak.com/articles/asynchronous-strategieshttps://angelosioak.com/articles/asynchronous-strategiesA working reference for how JavaScript actually schedules async work - tasks vs microtasks, and which Promise method (all, allSettled, any, race) fits which situation.Tue, 11 Aug 2026 00:00:00 GMTjavascripthttps://angelosioak.com/articles/iterables-loops-jshttps://angelosioak.com/articles/iterables-loops-jsA working reference for JS/TS loops - which loop type to reach for, and the five different ways to iterate asynchronously without tangling parallel and sequential execution.Tue, 11 Aug 2026 00:00:00 GMTjavascript