<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Doubly Linked Lists on Pocket Dev</title><link>/tags/doubly-linked-lists/</link><description>Recent content in Doubly Linked Lists on Pocket Dev</description><generator>Hugo</generator><language>en-us</language><lastBuildDate>Wed, 26 Mar 2025 19:23:00 +0000</lastBuildDate><atom:link href="/tags/doubly-linked-lists/index.xml" rel="self" type="application/rss+xml"/><item><title>Doubly Linked Lists: Bidirectional Navigation Made Easy</title><link>/posts/doubly-linked-lists-bidirectional-navigation-made-easy/</link><pubDate>Wed, 26 Mar 2025 19:23:00 +0000</pubDate><guid>/posts/doubly-linked-lists-bidirectional-navigation-made-easy/</guid><description>&lt;h2 id="understanding-data-structures-through-big-o-notation"&gt;Understanding Data Structures Through Big O Notation&lt;/h2&gt;
&lt;p&gt;In our previous discussion on &lt;strong&gt;Big O notation&lt;/strong&gt;, we explored how it helps us measure the efficiency of algorithms. Now, let’s take the next logical step: &lt;strong&gt;understanding data structures in the context of Big O.&lt;/strong&gt;&lt;/p&gt;</description></item></channel></rss>