This article example compares javascript and Python fast sorting implementation. Shared for your reference. Specific as follows:
js implementation method:
function quicksort(arr) {
if ( <= 1) return arr
return quicksort((function (lt, i) {return i > 0 && lt < arr[0]}))
.concat([arr[0]])
.concat(quicksort((function(ge, i) {return i > 0 && ge >= arr[0]})))
}
python implementation method:
def quicksort(arr): if len(arr) <= 1: return arr return quicksort([lt for lt in arr[1:] if lt < arr[0]]) + a[0:1] + \ quicksort([ge for ge in arr[1:] if ge >= arr[0]])
I hope that what I have said in this article will help you in your javascript and Python programming.