Skip to content

added select sort #30

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

Merged
merged 1 commit into from
Jun 9, 2020
Merged

added select sort #30

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
14 changes: 14 additions & 0 deletions algorithms/sorting/select_sort.m
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,14 @@
%% Octave implementation for selection sort
function arrayToSort = select_sort(arrayToSort)
for i=1:length(arrayToSort)
%%smallest element in the unsorted list
minimun_index=i;
Copy link

@luislizarraga luislizarraga Jun 10, 2020

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Typo? (minimum)

for j=i+1:length(arrayToSort)
if (arrayToSort(j) < arrayToSort(minimun_index))
minimun_index=j;
endif
endfor
%%replace the element with the minimun value of the unsorted array
arrayToSort([i minimun_index]) = arrayToSort([minimun_index i]);
endfor
endfunction