I need to find the shortest code for reversing an array and at the moment I have this:

weirdReverse=a=>a.sort(()=>1)

This is a codewars challenge and the length of this is 29 bytes. I need to have a length <=28 so I need to remove 1 byte and I can't change this part:

weirdReverse=a=>a

And I can't use reverse().

I need to find the shortest code for reversing an array and at the moment I have this:

weirdReverse=a=>a.sort(()=>1)

This is a codewars challenge and the length of this is 29 bytes. I need to have a length <=28 so I need to remove 1 byte and I can't change this part:

weirdReverse=a=>a

And I can't use reverse().

• javascript
• arrays
• sorting
• reverse

• 1 How is sort order determined, here? Couldn't you just leave out the ()=>1? – Daedalus Commented May 22, 2018 at 22:11
• Sorry im dumb , i need to reverse it i just look on sort() and i write i need to sort it , description is changed now – Mariusz Commented May 22, 2018 at 22:13
• 3 array.reverse() .. am I missing something?? – mhodges Commented May 22, 2018 at 22:14
• didnt write it too ... i can't use reverse() – Mariusz Commented May 22, 2018 at 22:15

2 Answers 2

You can golf one byte off your anonymous arrow function by specifying an unused parameter instead of () to indicate no named parameters, bringing the total down to 28 bytes:

weirdReverse=a=>a.sort(_=>1)

You can use a named parameter instead of braces, like so:

weirdReverse=a=>a.sort(b=>1)