Given an integer array, sort it in ascending order.
Use quick sort, merge sort, heap sort or any O(nlogn) algorithm.
Example
Given [3, 2, 1, 4, 5], return [1, 2, 3, 4, 5].
https://www.cnblogs.com/grandyang/p/5637862.html
Given an integer array, sort it in ascending order.
Use quick sort, merge sort, heap sort or any O(nlogn) algorithm.
Example
Given [3, 2, 1, 4, 5], return [1, 2, 3, 4, 5].
https://www.cnblogs.com/grandyang/p/5637862.html