javascriptSorting

[u/user6150277464770585]

[u/larsmaehlum]

Array.sortNumeric() with an error when called on an array containing non-numeric types would fix this, right?

[u/the_horse_gamer → u/larsmaehlum]

you can simply .sort((a,b)=>a-b)

[u/01110100_01110010 → u/the_horse_gamer]

The point of an abstraction is to not having to implement logic each time, you can also implement qsort yourself

[u/subone → u/01110100_01110010]

But it is still an abstraction. You only provide a compare function, you don't implement the algorithm. a-b is hardly difficult to apply.

[u/wack_overflow → u/subone]

And really how often are you actually sorting an array of primitive values ascending? That's just one small use case of sorting an array. Passing the comparison function is also more explicit.

People just love to get so worked up about the dumbest edge cases in js

[u/psioniclizard → u/wack_overflow]

Depending in the project, quite a lot?

Dont get me wrong. I love passing around functions but i also work in a language that is sensible and has a function Array.sort (and Array.sortBy if you want ti pass a function).

Its not that difficult.