Skip to content

Create selectionSort.m #61

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Create selectionSort.m #61

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
24 changes: 24 additions & 0 deletions algorithms/sorting/selectionSort.m
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -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