<?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 Bluue Whale</title><link>https://bluuewhale.github.io/ko/tags/data-structure/</link><description>Recent content in Data Structure on Bluue Whale</description><image><title>Bluue Whale</title><url>https://bluuewhale.github.io/images/profile.jpg</url><link>https://bluuewhale.github.io/images/profile.jpg</link></image><generator>Hugo -- 0.152.2</generator><language>ko-kr</language><lastBuildDate>Sat, 22 Aug 2026 22:21:36 +0900</lastBuildDate><atom:link href="https://bluuewhale.github.io/ko/tags/data-structure/index.xml" rel="self" type="application/rss+xml"/><item><title>Sparse Matrix &amp; CSR</title><link>https://bluuewhale.github.io/ko/posts/sparse-matrix-and-csr/</link><pubDate>Wed, 01 Apr 2026 16:23:49 +0900</pubDate><guid>https://bluuewhale.github.io/ko/posts/sparse-matrix-and-csr/</guid><description>대부분의 원소가 0인 희소 행렬을 values, column_indices, row_pointers 세 배열만으로 표현하는 CSR(Compressed Sparse Row) 구조와, 이를 활용한 SpMV·그래프 이웃 탐색 최적화를 정리합니다.</description></item><item><title>Accidental Quadratic Hashmap Iteration</title><link>https://bluuewhale.github.io/ko/posts/accidental-quadratic-hashmap-iteration/</link><pubDate>Mon, 08 Dec 2025 22:53:14 +0900</pubDate><guid>https://bluuewhale.github.io/ko/posts/accidental-quadratic-hashmap-iteration/</guid><description>해시 순서(hash ordering)가 겹칠 때, 오픈 어드레싱 해시 테이블을 순회하며 다른 테이블에 재삽입하는 흔한 코드가 왜 O(n^2)으로 폭발하는지 살펴봅니다.</description></item></channel></rss>