Quick sorting guided by sorting algorithms
Class Program <br/>{< br/> static void main (string [] ARGs) <br/>{< br/> int [] arr = new int [] {110,}; <br/> quicksort (ARR, 0, arr. length-1); <br/> console. write ("data after quicksort:"); <br/> foreach (int I in ARR) <br/>{< br/> console. write (I + ","); <br/>}< br/> console. readline (); <br/>}</P> <p> # region Quick Sort </P> <p> static int partion (INT [] data, int low, int high) <br/>{< br/> int I = low; <br/> Int J = high; <br/> int lower = data [low]; </P> <p> while (I <j) <br/> {<br/> while (I <J & Data [J]> = cursor) <br/> j --; <br/> if (I <j) <br/> data [I ++] = data [J]; </P> <p> while (I <J & Data [I] <= cursor) <br/> I ++; </P> <p> if (I <j) <br/> data [j --] = data [I]; <br/>}< br/> data [I] = response; <br/> return I; <br/>}</P> <p> static void quicksort (INT [] data, int low, int high) <br/>{< br/> int success; </P> <p> If (low <pigh) <br/>{< br/> partition = partion (data, low, high ); <br/> quicksort (data, low, latency-1); <br/> quicksort (data, latency + 1, high ); <br/>}</P> <p> # endregion <br/>}