AMS $-$ Sorting in O$($n$)$

Languag

$1$

#

Problem Definition:

An input array contains only $3$ distinct non zero positive numbers. Sort the array in O$($n$)$ time complexity.

Constrain:

$$ Maximum size of array is $100.$

$$ Three number are distinct.

$$ Numbers are less than $1000,$

$$ Number can be repeated any numbers of time.

$$ Number may not be repeated.

E$.$g$.$

Input: $6338633836$

Output: $3333366688$