The rapid sorting method is a classic algorithm. Generally, the efficiency is highly bubbling, which is very useful in the table data sort of the web client. The JScript implementation of the algorithm is given below, because the algorithm is very simple, it will not add a comment. Function Quicksort (Data, Low, High, Bgreater) {var MID = DATA [Low]; var index = low; for (var i = low 1; i <= high; i ) {var Needswap = false; if (bgreater Needswap = DATA [I] MID; IF (Needswap) {INDEX ; SWAP (Data, I, INDEX);}} Swap (Data, INDEX, LOW); IF (Index - 1> Low) Quicksort (Data, Low, INDEX - 1, BGReater); IF (INDEX 1
