21 lines
1.0 KiB
Plaintext
21 lines
1.0 KiB
Plaintext
{{Sorting Algorithm}}
|
|
[[Category:Sorting]]
|
|
|
|
{{noticebox||Note: jortSort is considered a work of satire. It achieves its result in an intentionally roundabout way. You are encouraged to write your solutions in the spirit of the original jortsort rather than trying to give the most concise or idiomatic solution.}}
|
|
|
|
|
|
JortSort is a sorting tool set that makes the user do the work and guarantees efficiency because you don't have to sort ever again.
|
|
<br>It was originally presented by Jenn "Moneydollars" Schiffer at the
|
|
prestigious [https://www.youtube.com/watch?v=pj4U_W0OFoE JSConf].
|
|
|
|
|
|
JortSort is a function that takes a single array of comparable objects as its argument.
|
|
|
|
It then sorts the array in ascending order and compares the sorted array to the originally provided array.
|
|
|
|
If the arrays match (i.e. the original array was already sorted), the function returns '''true'''.
|
|
|
|
If the arrays do not match (i.e. the original array was not sorted), the function returns '''false'''.
|
|
<br><br>
|
|
|