A Collection of Code Snippets in as Many Programming Languages as Possible

This project is maintained by TheRenegadeCoder

Welcome to the Selection Sort in Julia page! Here, you'll find the source code for this program as well as a description of how the program works.

```
#!/usr/bin/julia
function SelectionSort(arr)
l = length(arr)
sorted_list = []
for i = 1:l
m = minimum(arr)
push!(sorted_list,m)
deleteat!(arr, findfirst(x->x==m,arr))
end
return sorted_list
end
function error()
println("Usage: please provide a list of at least two integers to sort in the format \"1, 2, 3, 4, 5\"")
end
function HandleInput(inp)
a = split(inp,",")
a = map(x->split(x," "),a)
a = map(x->last(x),a)
numbers = map(x->parse(Int,x),a)
if length(numbers) == 1
error()
exit()
end
return numbers
end
function PrintOutput(out)
for i = 1:length(out)
print(out[i])
if i != length(out)
print(", ")
end
end
println()
end
try
n = HandleInput(ARGS[1])
sorted = SelectionSort(n)
PrintOutput(sorted)
catch e
error()
end
```

Selection Sort in Julia was written by:

- sniklas142

If you see anything you'd like to change or update, please consider contributing.

**Note**: The solution shown above is the current solution in the Sample Programs repository as of Oct 01 2020 20:52:15. The solution was first committed on Oct 01 2020 15:22:44. As a result, documentation below may be outdated.

No 'How to Implement the Solution' section available. Please consider contributing.

No 'How to Run the Solution' section available. Please consider contributing.