<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Fundamentals on Software Design</title><link>https://software-design.dev/computer-science/fundamentals/</link><description>Recent content in Fundamentals on Software Design</description><generator>Hugo</generator><language>en</language><copyright>Copyright (c) 2026 Daniil Dzemidovich</copyright><lastBuildDate>Sun, 03 Sep 2023 14:13:23 +0200</lastBuildDate><atom:link href="https://software-design.dev/computer-science/fundamentals/index.xml" rel="self" type="application/rss+xml"/><item><title>Algorithms Analyses</title><link>https://software-design.dev/computer-science/fundamentals/algorithms-analyses/</link><pubDate>Sun, 03 Sep 2023 14:13:23 +0200</pubDate><guid>https://software-design.dev/computer-science/fundamentals/algorithms-analyses/</guid><description>&lt;h2 id="-algorithm-complexity"&gt;📐 Algorithm complexity&lt;/h2&gt;
&lt;h3 id="time-complexity"&gt;Time complexity&lt;/h3&gt;
&lt;p&gt;&lt;strong&gt;Time complexity&lt;/strong&gt; specifies how long it will take to execute an algorithm as a function of its input size. It provides an &lt;strong&gt;upper-bound&lt;/strong&gt; on the running time of an algorithm.&lt;/p&gt;</description></item></channel></rss>