<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/"><channel><title>Insert on Void *Pablogs</title><link>https://pablogs.dev/tags/insert/</link><description>Recent content in Insert on Void *Pablogs</description><generator>Hugo</generator><language>en</language><lastBuildDate>Fri, 17 Jul 2026 00:00:00 +0000</lastBuildDate><atom:link href="https://pablogs.dev/tags/insert/index.xml" rel="self" type="application/rss+xml"/><item><title>Insert, Remove, and the Cost of Shifting</title><link>https://pablogs.dev/posts/insert-remove-memmove-swap-remove-dynamic-array-c/</link><pubDate>Fri, 17 Jul 2026 00:00:00 +0000</pubDate><guid>https://pablogs.dev/posts/insert-remove-memmove-swap-remove-dynamic-array-c/</guid><description>Implement insert and remove with memmove in a C dynamic array, measure the O(n) shifting cost in bytes, and build a constant-time swap-remove for unordered data.</description></item></channel></rss>