ta","20",{"name":"twitter:description","content":"Practice coding problems, learn algorithms and data structures, and improve your programming skills with K5kC."}],["$","meta","21",{"name":"twitter:image","content":"https://k5kc.com/images/og-image.png"}]] 1e:I[34242,["/_next/static/chunks/5374600b61945acd.js","/_next/static/chunks/75bfb27789fc0b9a.js"],"default"] 1f:I[34263,["/_next/static/chunks/5374600b61945acd.js","/_next/static/chunks/75bfb27789fc0b9a.js"],"default"] 20:I[56081,["/_next/static/chunks/5374600b61945acd.js","/_next/static/chunks/75bfb27789fc0b9a.js"],"default"] 21:I[12820,["/_next/static/chunks/5374600b61945acd.js","/_next/static/chunks/75bfb27789fc0b9a.js"],"default"] 22:I[15024,["/_next/static/chunks/5374600b61945acd.js","/_next/static/chunks/75bfb27789fc0b9a.js"],"default"] 23:Tb8b,

Problem

Given an array of integers nums, sort the array in ascending order.

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

Examples

Example 1

Input: Array of numbers , unsorted. Eg. array-sorting.excalidraw

Output : Same numbers sorted in some order, say increasing order. Eg.

Input:
nums = [7, 4, 6, 1, 3, 5, 8, 2]
Output:
 [1, 2, 3, 4, 5, 6, 7, 8]

Solution

There are multiple solutions to this. Here are some:

Integer Specific

Sorting an Object

Java

Java Sorting Collections Index

Time Complexity

Sorting Algorithms Time Complexity Comparison

16:["$","div",null,{"className":"max-w-7xl mx-auto px-4 py-8","children":[["$","header",null,{"className":"mb-8 pb-4","children":[["$","div",null,{"className":"flex flex-wrap items-start justify-between gap-4","children":[["$","h1",null,{"className":"text-4xl font-bold text-gray-900 dark:text-gray-100","children":"Sort an ar

Related Tags