Skip to main content
{} stackoverfun

Code Golf · #14 · 2026-04-18

Sort numbers ascending

Difficulty 1/3 · JavaScript

How to play

Write a JavaScript function body that passes all test cases using the fewest characters. Run against examples first, then submit for the full test suite. Eagle < Birdie < Par.

Given an array of numbers, return them sorted in ascending order.

Examples

f([3,1,2]) → 1,2,3
f([5,3,8,1]) → 1,3,5,8

Loading your progress...

Your code (function body — receives input)

function(input) { 0 chars
}

Write the shortest JavaScript function body that passes all tests · Back to hub