<?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 Yukari's Blog</title><link>https://yukar.icu/tags/data-structure/</link><description>Recent content in Data Structure on Yukari's Blog</description><generator>Hugo</generator><language>zh-cn</language><lastBuildDate>Tue, 21 Jul 2026 00:00:00 +0000</lastBuildDate><atom:link href="https://yukar.icu/tags/data-structure/index.xml" rel="self" type="application/rss+xml"/><item><title>Data Structure: Note</title><link>https://yukar.icu/posts/cs/datastructure/</link><pubDate>Mon, 20 Jul 2026 00:00:00 +0000</pubDate><guid>https://yukar.icu/posts/cs/datastructure/</guid><description>&lt;p&gt;Remember that
&lt;/p&gt;
$$\text{Data Structure}=\text{Organization}+\text{Storage}+\text{Operation},$$&lt;p&gt;
base on which we develop algorithms to solve problems.&lt;/p&gt;
&lt;h1 id="organization--logical-structure"&gt;Organization &amp;amp; Logical Structure&lt;/h1&gt;
&lt;p&gt;The &lt;strong&gt;Organization&lt;/strong&gt;, equivalently, the &lt;strong&gt;logical structure&lt;/strong&gt; of data, is the intrinsic property of data, which determines the relationship between data elements and the operations on them, and it is independent from the storage.&lt;/p&gt;
&lt;p&gt;A simple example is the hash table, which realizes the mapping
&lt;/p&gt;
$$f:\text{key} \mapsto \text{value}$$&lt;p&gt;
by storing entries at locations $\{\text{Hash}(\text{key})\}$. The hash function provides only a storage structure; it does not impose any logical relationship between elements. Now consider the case where keys are taken from $([n])$ and values from a given data type
&lt;/p&gt;</description></item></channel></rss>