https://jinerx.github.io/posts/Recent content in Articles on JinerX blogHugo -- gohugo.ioen-us© 2026 Jędrzej SajnógWed, 04 Mar 2026 17:54:13 +0100https://jinerx.github.io/posts/algorithm-complexity-basics/Wed, 04 Mar 2026 17:54:13 +0100https://jinerx.github.io/posts/algorithm-complexity-basics/<p>Here we&rsquo;re going to consider the basics of complexity analysis - a critical part of algorithm analysis.</p> <h2 class="relative group">Motivation <div id="motivation" class="anchor"></div> <span class="absolute top-0 w-6 transition-opacity opacity-0 -start-6 not-prose group-hover:opacity-100 select-none"> <a class="text-primary-300 dark:text-neutral-700 !no-underline" href="#motivation" aria-label="Anchor">#</a> </span> </h2> <p>When running algorithms we can see that some programs end almost immediately and some take a long time. Complexity analysis aims to formalize this notion and give us tools to predict how long a program is going to run. It does so by looking at how much does the time for a program to terminate increase based on the increase in the size of the input. We do it by creating functions (mathematical) based on the algorithms which take in as input the size and return the &ldquo;time&rdquo;.</p>