there are many ways to sort an array, which you$$ll learn about in CS$301$ and CS$302.$

However, you don$$t need a fancy algorithm to sort a small array; it can be done using a brute force

approach, especially in this case because the input array that you$$ll be creating will have only $3$

entries. You can enumerate all of the possible combinations of entries in anArray using an if$-$

else loop. For example, if the input array has entries $1,6,3,$ then you$$d check whether $1<6,$ and

then whether $6<3,$ and perform swapping when necessary to rearrange the entries to $1,3,6.$