all tasks
This commit is contained in:
parent
b83f433714
commit
68f8f3e56b
14735 changed files with 178959 additions and 0 deletions
|
|
@ -0,0 +1,24 @@
|
|||
function list = selectionSort(list)
|
||||
|
||||
listSize = numel(list);
|
||||
|
||||
for i = (1:listSize-1)
|
||||
|
||||
minElem = list(i);
|
||||
minIndex = i;
|
||||
|
||||
%This for loop can be vectorized, but there will be no significant
|
||||
%increase in sorting efficiency.
|
||||
for j = (i:listSize)
|
||||
if list(j) <= minElem
|
||||
minElem = list(j);
|
||||
minIndex = j;
|
||||
end
|
||||
end
|
||||
|
||||
if i ~= minIndex
|
||||
list([minIndex i]) = list([i minIndex]); %Swap
|
||||
end
|
||||
|
||||
end %for
|
||||
end %selectionSort
|
||||
|
|
@ -0,0 +1,5 @@
|
|||
>> selectionSort([4 3 1 5 6 2])
|
||||
|
||||
ans =
|
||||
|
||||
1 2 3 4 5 6
|
||||
Loading…
Add table
Add a link
Reference in a new issue