js 快速排序

function qSort( arr ) {function _qSort( arr , l , r ) {if( l < r ) {var m = arr[ parseInt( ( l + r ) / 2 ) ] , i = l - 1 , j = r + 1;while ( true ) {while( arr[ ++i ] < m );while( arr[ --j ] > m );if ( i >= j ) break;var tmp = arr[ i ];arr[ i ] = arr[ j ];arr[ j ] = tmp;}_qSort( arr , l , i - 1 );_qSort( arr , j + 1 , r );}}_qSort( arr , 0 , arr.length - 1 );return arr;}