1. Calculate 8([4,1,3, 2]), where s is the insertion-sort function, as in the slides, showing every...

Transcribed Image Text:

1. Calculate 8([4,1,3, 2]), where s is the insertion-sort function, as in the slides, showing every step. 2. Look up the selection-sort algorithm. Translate the algorithm into functional pseudo-code. (Note that selection does not require swapping. You may find it helpful to test your code using ALTO.) 1. Calculate 8([4,1,3, 2]), where s is the insertion-sort function, as in the slides, showing every step. 2. Look up the selection-sort algorithm. Translate the algorithm into functional pseudo-code. (Note that selection does not require swapping. You may find it helpful to test your code using ALTO.)