You must write a pseudocode process called swapSort which should sort a list of numbers using an algorithm called swap sort. You will need to implement (meaning write the code that actually does) the above. You won’t necessarily know how long your list is, but you will have variables that tells you:

let list be the list of numbers we want to sort
let n be the length of list

You will also often need to access an element of list to do this problem. You may do that in the manner below:

list[1] is the 1st element of the list, list[2] is the 2nd element, etc. list[n] would be the nth (which is to say last, if your list had length n) element of the list.