If you are enrolled in a LaunchCode program, access this studio by following the repl.it classroom links posted in your class at learn.launchcode.org.

If you are working through this material on your own, use the repl.it links contained on this page.

Recall that using the `sort`

method on an array of numbers
produced an unexpected result, since JavaScript converts
the numbers to strings by default. Let's fix this!

Here is one approach to sorting an array:

- Find the minimum value in an array,
- Add that value to a new array,
- Remove the entry from the old array,
- Repeat steps 1 - 3 until the numbers are all in order.

Create a function with an array of numbers as its parameter. The function should iterate through the array and return the minimum value from the array.

*Hint*: Use what you know about `if`

statements to identify and
store the smallest value within the array.

Tip

Use this sample data for testing.

1 2 3 | ```
[ 5, 10, 2, 42 ]
[ -2, 0, -10, -44, 5, 3, 0, 3 ]
[ 200, 5, 4, 10, 8, 5, -3.3, 4.4, 0 ]
``` |

Create another function with an array of numbers as its parameter. Within this function:

- Define a new, empty array to hold the final sorted numbers.
- Use your function from the previous exercise to find the minimum value in the old array.
- Add the minimum value to the new array, and remove the minimum value from the old array.
- Repeat parts b & c until the old array is empty.
- Return the new sorted array.
*Be sure to print the results in order to verify your code*.

Code studio part B at repl.it.

Tip

*Which type of loop?*

Either a `for`

or `while`

loop will work inside this function, but one
IS a better choice. Consider what the function must accomplish vs. the
behavior of each type of loop. Which one best serves if the array has an
unknown length?

The sorting approach used above is an example of a *selection sort*. The
function repeatedly checks an array for the minimum value, then places that
value into a new container.

Selection sorting is NOT the most efficient way to accomplish the task, since it requires the function to pass through the array once for each item within the array. This takes way too much time for large arrays.

Fortunately, JavaScript has an elegant way to properly sort numbers.

Tip

Here is a nice, visual comparison of different sorting methods.

Feel free to Google "bubble sort JavaScript" to explore a different way to order numbers in an array.

If you Google "JavaScript sort array of numbers" (or something similar), many options appear, and they all give pretty much the same result. The sites just differ in how much detail they provide when explaining the solution.

One reference is here: W3Schools.

End result: the JavaScript syntax for numerical sorting is
`arrayName.sort(function(a, b){return a-b});`

.

Here, the anonymous function determines which element is larger and swaps the
positions if necessary. This is all that `sort`

needs to order the entire
array.

Using the syntax listed above:

- Sort each sample array in increasing order.
- Sort each sample array in decreasing order.
- Does the function alter
`arrayName`

? - Did your sorting function from part B alter
`arrayName`

?

Each programming language (Python, Java, C#, JavaScript, etc.) has built-in sorting methods, so why did we ask you to build one?

It's kind of a programming right of passage - design an efficient sorting function. Also, sorting can help you land a job.

As part of a tech interview, you will probably be asked to do some live-coding. One standard, go-to question is to sort an array WITHOUT relying on the built in methods. Knowing how to think though a sorting task, generate the code and then clearly explain your approach will significantly boost your appeal to an employer.

Refactor your sorting function from Part B to use recursion.