Scan unsorted for the smallest remaining element. Remove that element from unsorted and add it to the tail of sorted. Remove the first element from unsorted and find the point where it should go in ...
This is the first assessed exercise (out of two) of ADSE2 course in term 2 of year 2 in Bsc Computing Science degree in the University of Glasgow that I have submitted on Friday 11th February, 2022.
Some results have been hidden because they may be inaccessible to you
Show inaccessible results