a)
function list = listSort(list) sorted = 0; len = length(list); while sorted == 0 sorted = 1; for i = 2:len if list(i) < list(i-1) temp = list(i); list(i) = list(i-1); list(i-1) = temp; sorted = 0; end end end end
b)
function sortedList = insertionSort(list) len = length(list); sortedList = zeros(1,len); while len > 0 temp = -Inf; for i = 1:len if list(i) > temp temp = list(i); tempI = i; end end sortedList(len) = list(tempI); len = len-1; list(tempI) = []; end end
c)
function mat = untitledFunction7(mat) [l,~] = size(mat); for i =1: l mat(i,:) = insertionSort(mat(i,:)); end end