<?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>Data-Structure on bromine1997</title><link>https://bromine1997.github.io/tags/data-structure/</link><description>Recent content in Data-Structure on bromine1997</description><generator>Hugo</generator><language>ko-KR</language><lastBuildDate>Wed, 08 Apr 2026 00:00:00 +0000</lastBuildDate><atom:link href="https://bromine1997.github.io/tags/data-structure/index.xml" rel="self" type="application/rss+xml"/><item><title>[자료구조] 1편 - 배열과 동적 배열: 메모리를 직접 다루다</title><link>https://bromine1997.github.io/posts/algorithm/algorithm-01-array/</link><pubDate>Wed, 08 Apr 2026 00:00:00 +0000</pubDate><guid>https://bromine1997.github.io/posts/algorithm/algorithm-01-array/</guid><description>int arr[10]부터 malloc()을 이용한 동적 배열까지. C언어에서 데이터를 저장하는 가장 기본적인 방법과 메모리 구조를 정리한다.</description></item></channel></rss>