Search⌘ K
AI Features
Home
Courses
Grokking the Coding Interview Patterns in C#

Solution: Sort an Array

Explore how to sort an integer array using heap sort to achieve O(n log n) time complexity and minimal extra space. This lesson guides you through building a max heap and in-place sorting, ensuring an efficient solution while avoiding built-in sort functions.

We'll cover the following...

Statement

Given an integer array, nums, sort it in ascending order and return the sorted array.

You must implement the sorting algorithm yourself; do not use any built-in sorting functions. The solution must run in O(nlog⁡n)O(n \log n) time and use the minimum possible extra space.

Constraints:

  • 1≤1 \leq nums.length ≤103\leq 10^3

  • −103≤-10^3 \leq nums[i] ≤103\leq 10^3 ...