# using the methods available in StaticArray class because we are not allowed to use the built$-$in methods in Python

minVal $=$ array.get$(0)$

maxVal $=$ array.get$(0)$

arrayLength $=$ array.length$()$

# Finding min and max values of the input array

for x in range$(1,$ arrayLength$)$:

temp $=$ array.get$($i$)$

# We must not use inbuilt min$()$ and max$()$ functions

if$($maxVal $<$ temp$)$:

maxVal $=$ temp

elif$($minVal $>$ temp$)$:

minVal $=$ temp

# Finding the range of values present in the array

rangeOfValues $=($maxVal $-$ minVal$)+1$

# count$\_$arr stores the count of each value in the array

count$\_$arr $=$ StaticArray$($rangeOfValues$)$

for i in range$($rangeOfValues$)$:

count$\_$arr.set$($i$,0)$

for i in range$($arrayLength$)$:

temp $=$ array.get$($i$)$

j $=$ temp $-$ minVal

count$\_$arr.set$($j$,$ count$\_$arr.get$($j$+1))$

# sorted array to be returned

sortedStaticArray $=$ StaticArray$($arrayLength$)$

lastIndex $=$ arrayLength $-1$

for i in range$($rangeOfValues$-1,-1,-1)$: # loop thrugh the array in the reverse order

while$($count$\_$arr.get$($i$)>0)$:

temp $=$ i $+$ minVal

sortedStaticArray.set$($lastIndex$,$ temp$)$

lastIndex $-=1$

count$\_$arr.set$($i$,($count$\_$arr.get$($i$)-1))$

return sortedStaticArray