sort-an-array

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

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 necessairly 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

给你一个整数数组&nbsp;<code>nums</code>，请你将该数组升序排列。

你必须在 不使用任何内置函数 的情况下解决问题，时间复杂度为 <code>O(nlog(n))</code>，并且空间复杂度尽可能小。

&nbsp;

<ol>
</ol>

示例 1：

<pre>
输入：nums = [5,2,3,1]
输出：[1,2,3,5]
</pre>

示例 2：

<pre>
输入：nums = [5,1,1,2,0,0]
输出：[0,0,1,1,2,5]
</pre>

&nbsp;

提示：

<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>