Skip to main content
Best answer by LucMeekes

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

1 reply

V
ValeryOchkov24-Ruby IVAuthor
24-Ruby IV
December 5, 2017

Sorry, I cannot edit my topic and must attach the Mathcad 15 file in this reply

L
LucMeekes23-Emerald IV
23-Emerald IV
December 5, 2017

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

V
ValeryOchkov24-Ruby IVAuthor
24-Ruby IV
December 5, 2017
@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

Terms & ConditionsAccessibility statement