sort-an-array

java

python3

python

javascript

typescript

csharp

golang

kotlin

swift

rust

ruby

dart

scala

elixir

erlang

racket

cangjie

bash

mysql

mssql

postgresql

oraclesql

pythondata

Algorithms

Given an array of integers <code>nums</code>, sort the array in ascending order and return it.

You must solve the problem without using any built-in functions in <code>O(nlog(n))</code> time complexity and with the smallest space complexity possible.

&nbsp;
Example 1:

<pre>
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).
</pre>

Example 2:

<pre>
Input: nums = [5,1,1,2,0,0]
Output: [0,0,1,1,2,5]
Explanation: Note that the values of nums are not necessarily unique.
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= nums.length &lt;= 5 * 104</code></li>
	<li><code>-5 * 104 &lt;= nums[i] &lt;= 5 * 104</code></li>
</ul>

sortArray

Sort an Array

Array

Divide and Conquer

Bucket Sort

Counting Sort

Radix Sort

Sorting

Heap (Priority Queue)

Merge Sort

&#32473;&#20320;&#19968;&#20010;&#25972;&#25968;&#25968;&#32452;&nbsp;<code>nums</code>&#65292;&#35831;&#20320;&#23558;&#35813;&#25968;&#32452;&#21319;&#24207;&#25490;&#21015;&#12290;

&#20320;&#24517;&#39035;&#22312; &#19981;&#20351;&#29992;&#20219;&#20309;&#20869;&#32622;&#20989;&#25968; &#30340;&#24773;&#20917;&#19979;&#35299;&#20915;&#38382;&#39064;&#65292;&#26102;&#38388;&#22797;&#26434;&#24230;&#20026; <code>O(nlog(n))</code>&#65292;&#24182;&#19988;&#31354;&#38388;&#22797;&#26434;&#24230;&#23613;&#21487;&#33021;&#23567;&#12290;

&nbsp;

<ol>
</ol>

&#31034;&#20363; 1&#65306;

<pre>
&#36755;&#20837;&#65306;nums = [5,2,3,1]
&#36755;&#20986;&#65306;[1,2,3,5]
&#35299;&#37322;&#65306;&#25968;&#32452;&#25490;&#24207;&#21518;&#65292;&#26576;&#20123;&#25968;&#23383;&#30340;&#20301;&#32622;&#27809;&#26377;&#25913;&#21464;&#65288;&#20363;&#22914;&#65292;2 &#21644; 3&#65289;&#65292;&#32780;&#20854;&#20182;&#25968;&#23383;&#30340;&#20301;&#32622;&#21457;&#29983;&#20102;&#25913;&#21464;&#65288;&#20363;&#22914;&#65292;1 &#21644; 5&#65289;&#12290;
</pre>

&#31034;&#20363; 2&#65306;

<pre>
&#36755;&#20837;&#65306;nums = [5,1,1,2,0,0]
&#36755;&#20986;&#65306;[0,0,1,1,2,5]
&#35299;&#37322;&#65306;&#35831;&#27880;&#24847;&#65292;nums &#30340;&#20540;&#19981;&#19968;&#23450;&#21807;&#19968;&#12290;
</pre>

&nbsp;

&#25552;&#31034;&#65306;

<ul>
	<li><code>1 &lt;= nums.length &lt;= 5 * 104</code></li>
	<li><code>-5 * 104 &lt;= nums[i] &lt;= 5 * 104</code></li>
</ul>

Sunbelt Computer Software

PL/B Language Development and Support