JSFiddle - React, Tailwind, and code Playground

by jrab227

JavaScript

var quicksort = function(A, lo, hi){
    if (lo < hi){
    	var pivot = partition(A, lo, hi)
        quicksort(A, lo, pivot-1)
        quicksort(A, pivot + 1, hi)
    }
    return A
}

var partition = function(A, lo, hi){
	var pivot = hi
    var i = lo
    for (var j = lo; j < hi; j++){
        if (A[j] <= A[pivot]) {
            var hold = A[j]
            A[j] = A[i]
            A[i] = hold
            i++
        }
    }
    var hold = A[pivot]
        A[pivot] = A[i]
        A[i] = hold
    return i
}

var v = [10, 4, 5, 6, 1, 2, 9, 7, 3, 8]
var j = [10, 4, 5]
quicksort(v, 0, 9)
alert(v)