<?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>Rotated Array on Jeanphilo Blog</title><link>https://shio-chan-dev.github.io/jeanblog/tags/rotated-array/</link><description>Recent content in Rotated Array on Jeanphilo Blog</description><generator>Hugo -- 0.165.0</generator><language>en-us</language><lastBuildDate>Tue, 28 Jul 2026 16:13:57 +0800</lastBuildDate><atom:link href="https://shio-chan-dev.github.io/jeanblog/tags/rotated-array/index.xml" rel="self" type="application/rss+xml"/><item><title>LeetCode 153: Find Minimum in Rotated Sorted Array</title><link>https://shio-chan-dev.github.io/jeanblog/alg/leetcode/binary-search/153-find-minimum-in-rotated-sorted-array/</link><pubDate>Tue, 28 Jul 2026 16:13:57 +0800</pubDate><guid>https://shio-chan-dev.github.io/jeanblog/alg/leetcode/binary-search/153-find-minimum-in-rotated-sorted-array/</guid><description>Start from a linear scan, derive a closed minimum-containing interval, and return the rotated array&amp;#39;s minimum in O(log n) time and O(1) auxiliary space.</description></item><item><title>LeetCode 33: Search in Rotated Sorted Array</title><link>https://shio-chan-dev.github.io/jeanblog/alg/leetcode/binary-search/33-search-in-rotated-sorted-array/</link><pubDate>Tue, 28 Jul 2026 15:40:34 +0800</pubDate><guid>https://shio-chan-dev.github.io/jeanblog/alg/leetcode/binary-search/33-search-in-rotated-sorted-array/</guid><description>Derive sorted-half recognition and target-range tests from a linear baseline to search a rotated array in O(log n) time and O(1) auxiliary space.</description></item></channel></rss>