There is a lot of algorithm of sorting.
See please https://en.wikipedia.org/wiki/Sorting_algorithm
What name has this Mathcad algorithm?
See please the Mathcad-sheet in attach and animation below
Solved! Go to Solution.
Valery,
I think it complies with the description of 'Selection sort' (https://en.wikipedia.org/wiki/Selection_sort), but with the additional property that your sorting algorithm takes up twice as much memory....
Where selection sort is usually done 'in-place' you set the sorted items aside in an additional part of memory.
Luc
Sorry, I cannot edit my topic and must attach the Mathcad 15 file in this reply
Join the club here:
https://community.ptc.com/t5/Community-Feedback/Editing-a-post-not-possible/td-p/493475
I would call this "sorting by picking".
Luc
@LucMeekes wrote:
I would call this "sorting by picking".
Luc
Thanks, Luc!
Can we see thies "sorting by picking" here https://en.wikipedia.org/wiki/Sorting_algorithm
Valery,
I think it complies with the description of 'Selection sort' (https://en.wikipedia.org/wiki/Selection_sort), but with the additional property that your sorting algorithm takes up twice as much memory....
Where selection sort is usually done 'in-place' you set the sorted items aside in an additional part of memory.
Luc
Thanks, Luc!
May be so