Reply to thread

Message

<blockquote data-quote="Anonymous_Abstract" data-source="post: 24659386" data-attributes="member: 568286">&nbsp; &nbsp;&nbsp; Code Of Quick Sortpackage com.benz.test;public class Quick {&nbsp; &nbsp; &nbsp; &nbsp; public int partition(int[] arr,int low,int high)&nbsp; &nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; int pivot = high;&nbsp; &nbsp; &nbsp; &nbsp; int l = low-1;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; for(int j=low;j&lt;=high-1;j++)&nbsp; &nbsp; &nbsp; &nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if(arr[j]&lt;=arr[pivot])&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; l+=1;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; swap(l,j,arr);&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }&nbsp; &nbsp; &nbsp; &nbsp; }&nbsp; &nbsp; &nbsp; &nbsp; swap(l+1,high,arr);&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; return l+1;&nbsp; &nbsp; }&nbsp; &nbsp; &nbsp; &nbsp; public int[] swap(int x,int y,int[] A)&nbsp; &nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; int temp = A[x];&nbsp; &nbsp; &nbsp; &nbsp; A[x] = A[y];&nbsp; &nbsp; &nbsp; &nbsp; A[y] =temp;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; return A;&nbsp; &nbsp; }&nbsp; &nbsp; &nbsp; &nbsp; public void quickSort(int[] arr,int low,int high)&nbsp; &nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; if(low&gt;=high)&nbsp; &nbsp; &nbsp; &nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; return;&nbsp; &nbsp; &nbsp; &nbsp; }else {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; int z = partition(arr,low,high);&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; quickSort(arr,low,z-1);&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; quickSort(arr,z+1,high);&nbsp; &nbsp; &nbsp; &nbsp; }&nbsp; &nbsp; }&nbsp; &nbsp; public void show(int[] arr)&nbsp; &nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; for(int i : arr)&nbsp; &nbsp; &nbsp; &nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; System.out.print(i+&quot;\t&quot;);&nbsp; &nbsp; &nbsp; &nbsp; }&nbsp; &nbsp; }&nbsp; &nbsp; public static void main(String[] args)&nbsp; &nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; Quick qu = new Quick();&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; int[] arr= {20,10,15,40,50,60,45};&nbsp; &nbsp; &nbsp; &nbsp; int high = arr.length-1;&nbsp; &nbsp; &nbsp; &nbsp; int low=0;&nbsp; &nbsp; &nbsp; &nbsp; qu.quickSort(arr, low, high);&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; System.out.println(&quot;Sorted Array&quot;);&nbsp; &nbsp; &nbsp; &nbsp; qu.show(arr);&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }}</blockquote>

[QUOTE="Anonymous_Abstract, post: 24659386, member: 568286"] [SIZE="5"] Code Of Quick Sort[/SIZE] [SIZE="4"][COLOR="Blue"]package com.benz.test; public class Quick { public int partition(int[] arr,int low,int high) { int pivot = high; int l = low-1; for(int j=low;j<=high-1;j++) { if(arr[j]<=arr[pivot]) { l+=1; swap(l,j,arr); } } swap(l+1,high,arr); return l+1; } public int[] swap(int x,int y,int[] A) { int temp = A[x]; A[x] = A[y]; A[y] =temp; return A; } public void quickSort(int[] arr,int low,int high) { if(low>=high) { return; }else { int z = partition(arr,low,high); quickSort(arr,low,z-1); quickSort(arr,z+1,high); } } public void show(int[] arr) { for(int i : arr) { System.out.print(i+"\t"); } } public static void main(String[] args) { Quick qu = new Quick(); int[] arr= {20,10,15,40,50,60,45}; int high = arr.length-1; int low=0; qu.quickSort(arr, low, high); System.out.println("Sorted Array"); qu.show(arr); } } [/COLOR][/SIZE] [/QUOTE]

Verification

Nawa warak dahaya keeyada? (Namaya wadi kireema dahaya)

Search

Latest ads

Reply to thread