Quick sorting and quick sorting algorithms

Quick sorting and quick sorting algorithms

<? Phpheader ("content-type: text/html; charset = UTF-8"); // fast sorting (not required) // problematic $ array = array, -35); // dynamically create 200000 pieces of data. Do not press it. The machine will die! /* For ($ I = 0; $ I <200000; $ I ++) {$ array [$ I] = rand );} */function quickSort ($ left, $ right, & $ array) {$ l = $ left; $ r = $ right; $ scheme = $ array [($ left + $ right)/2]; $ temp = 0; while ($ l <$ r) {while ($ array [$ l] <$ Scheme) $ l ++; while ($ array [$ r]> $ Scheme) $ r --; if ($ l >=$ r) break; $ temp = $ array [$ l]; $ array [$ l] = $ array [$ r]; $ array [$ r] = $ temp; if ($ array [$ l] = $ Scheme) -- $ r; if ($ array [$ r] = $ Scheme) + + $ l;} if ($ l = $ r) {$ l ++; $ r --;} if ($ left <$ r) quickSort ($ left, $ r, $ array); if ($ right> $ l) quickSort ($ l, $ right, $ array );} $ today = date ('Y-n-d G: I: s'); echo 'time before sorting is '. $ today; quickSort (0, count ($ array)-1, $ array); $ today = date ('Y-n-d G: I: s '); echo 'time after sorting is '. $ today; echo "<br/> ";