<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Posts on Rizwan Ahmed</title><link>https://rizahmeds.github.io/posts/</link><description>Recent content in Posts on Rizwan Ahmed</description><generator>Hugo -- gohugo.io</generator><language>en</language><lastBuildDate>Sat, 29 Nov 2025 00:00:00 +0530</lastBuildDate><atom:link href="https://rizahmeds.github.io/posts/index.xml" rel="self" type="application/rss+xml"/><item><title>Understanding Asymptotic Notation</title><link>https://rizahmeds.github.io/posts/2025-11-29-asymptotic-notation/</link><pubDate>Sat, 29 Nov 2025 00:00:00 +0530</pubDate><guid>https://rizahmeds.github.io/posts/2025-11-29-asymptotic-notation/</guid><description>Understanding Asymptotic Notation Link to heading When we write code or design an algorithm to solve a problem, it consists of a series of steps such as:
Sequencing (executing steps in order) Value assignment (e.g., x = 5) Selection (conditional logic like if/else) Iteration (loops) Each step takes some amount of time to execute. When we add up the time taken by all these steps, we get the runtime of the code or algorithm.</description></item></channel></rss>