<?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>Sort an Array on Dmytro&#39;s Blog</title>
    <link>https://dmytros.blog/tags/sort-an-array/</link>
    <description>Recent content in Sort an Array on Dmytro&#39;s Blog</description>
    <image>
      <title>Dmytro&#39;s Blog</title>
      <url>https://dmytros.blog/images/papermod-cover.png</url>
      <link>https://dmytros.blog/images/papermod-cover.png</link>
    </image>
    <generator>Hugo -- 0.147.1</generator>
    <language>en</language>
    <lastBuildDate>Mon, 17 Aug 2026 07:00:00 +0300</lastBuildDate>
    <atom:link href="https://dmytros.blog/tags/sort-an-array/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>LeetCode - Sort an Array</title>
      <link>https://dmytros.blog/posts/leetcode-sort-an-array/</link>
      <pubDate>Mon, 17 Aug 2026 07:00:00 +0300</pubDate>
      <guid>https://dmytros.blog/posts/leetcode-sort-an-array/</guid>
      <description>&lt;h3 id=&#34;the-problem&#34;&gt;The problem&lt;/h3&gt;
&lt;p&gt;Given an array of integers &lt;code&gt;nums&lt;/code&gt;, sort the array in ascending order and return it.&lt;/p&gt;
&lt;p&gt;You must solve the problem &lt;strong&gt;without using any built-in&lt;/strong&gt; functions in &lt;code&gt;O(nlog(n))&lt;/code&gt; time complexity and with the smallest space complexity possible.&lt;/p&gt;
&lt;p&gt;&lt;strong&gt;Example 1:&lt;/strong&gt;&lt;/p&gt;
&lt;pre tabindex=&#34;0&#34;&gt;&lt;code&gt;Input: nums = [5,2,3,1]
Output: [1,2,3,5]
Explanation: After sorting the array, the positions of some numbers are not changed (for example, 2 and 3), while the positions of other numbers are changed (for example, 1 and 5).
&lt;/code&gt;&lt;/pre&gt;&lt;p&gt;&lt;strong&gt;Example 2:&lt;/strong&gt;&lt;/p&gt;</description>
    </item>
  </channel>
</rss>
