a)
function list = listSort(list)
sorted = false;
while sorted == false
sorted = true;
for i = 2:length(list)
if list(i) < list(i-1)
temp = list(i);
list(i) = list(i-1);
list(i-1) = temp;
sorted = false;
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 = sortLists(mat) [l,~] = size(mat); for i =1: l mat(i,:) = insertionSort(mat(i,:)); end end
d)
function mat = sortMatrix(mat) mat = mat'; [x,y] = size(mat); list = reshape(mat,[1,x*y]); % Gjør matrisen om til en liste list = insertionSort(list); mat = reshape(list,[x,y]); % Gjør listen om til matrise igjen mat = mat'; % Den transponerte matrisen end
1 Comment
Unknown User (larshb)
28.09.2016For de som liker oneliners: