Re^4: random perversity

cboPerl wants to sort some numbers without using sort. That's the very definition of perverse and there seems to be little point in offering any type of logical advice regarding such an endeavour.

Comment on Re^4: random perversity

Replies are listed 'Best First'.
Re^5: sorting random numbers by Ratazong (Monsignor) on Oct 07, 2016 at 19:36 UTC
Sorting numbers without using `sort` is (in my eyes) a useful task in a beginners programming course. The student learns something about arrays here - and possibly something about algorithms and about partitioning a big problem (change the order of a huge list) into small steps (exchange two elements). So in my eyes it is far from being perverse. However the goal of the task is not reached if the student just copies some lines found in the internet. Speaking of this, I'm tempted to advise to use David Morgan-Mar's algorithm intelligent design sort - as it is easy to implement and very fast, especially for huge amounts of data. So long, Rata	[reply] [d/l]

Replies are listed 'Best First'.

Re^5: sorting random numbers
by Ratazong (Monsignor) on Oct 07, 2016 at 19:36 UTC

Sorting numbers without using sort is (in my eyes) a useful task in a beginners programming course. The student learns something about arrays here - and possibly something about algorithms and about partitioning a big problem (change the order of a huge list) into small steps (exchange two elements). So in my eyes it is far from being perverse.

However the goal of the task is not reached if the student just copies some lines found in the internet. Speaking of this, I'm tempted to advise to use David Morgan-Mar's algorithm intelligent design sort - as it is easy to implement and very fast, especially for huge amounts of data.

So long, Rata

[reply]
[d/l]