Sort an Array
As a Systems Engineer at Tata Consultancy Services, I deliver exceptional software products for mobile and web platforms, using agile methodologies and robust quality maintenance. I am experienced in performance testing, automation testing, API testing, and manual testing, with various tools and technologies such as Jmeter, Azure LoadTest, Selenium, Java, OOPS, Maven, TestNG, and Postman.
I have successfully developed and executed detailed test plans, test cases, and scripts for Android and web applications, ensuring high-quality standards and user satisfaction. I have also demonstrated my proficiency in manual REST API testing with Postman, as well as in end-to-end performance and automation testing using Jmeter and selenium with Java, TestNG and Maven. Additionally, I have utilized Azure DevOps for bug tracking and issue management.
Given an array of integers nums, sort the array in ascending order and return it.
You must solve the problem without using any built-in functions in O(nlog(n)) time complexity and with the smallest space complexity possible.
LeetCode Problem - 912
class Solution {
public int[] sortArray(int[] nums) {
// Create a priority queue (min-heap) to store the numbers
PriorityQueue<Integer> pq = new PriorityQueue<>();
// Add all elements of the array to the priority queue
for (int e : nums) {
pq.add(e);
}
// Retrieve the elements from the priority queue in sorted order
for (int i = 0; i < nums.length; i++) {
nums[i] = pq.poll();
}
// Return the sorted array
return nums;
}
}
