JortSort: Difference between revisions

=={{header|C sharp|C#}}==

{{trans|JavaScript}}

<lang csharp>using System;

class Program

{

public static bool JortSort<T>(T[] array) where T : IComparable, IEquatable<T>

{

// sort the array

T[] originalArray = (T[]) array.Clone();

Array.Sort(array);

// compare to see if it was originally sorted

for (var i = 0; i < originalArray.Length; i++)

{

if (!Equals(originalArray[i], array[i]))

{

return false;

}

}

return true;

}

}</lang>

=={{header|Perl 6}}==

<lang perl6>sub jort-sort { @_ eqv @_.sort }</lang>

Actually, there's a better internal sort that seems to work best for lists that are already completely sorted, but tends to fails for any other list. The name of this sort, <tt>[!after]</tt>, is completely opaque, so we're pretty much forced to hide it inside a subroutine to prevent widespread panic.

<lang perl6>sub jort-sort-more-better-sorta { [!after] @_ }</lang>

However, since Perl 6 has a really good inliner, there's really little point anyway in using the <tt>[!after]</tt> reduction operator directly, and <tt>jort-sort-more-better-sorta</tt> is really much more self-documenting, so please don't use the reduction operator if you can. For example:

{{out}}

<pre>$ perl6

> [!after] <a b c> # DON'T do it this way

True

> [!after] 1,3,2 # DON'T do it this way either

False</pre>

Please do your part to uphold and/or downhold our community standards.