Scribd
Upload
13 views

DAA Quick Sort

Daa quick sort

Uploaded by

pavanrajput1701
Copyright
© © All Rights Reserved
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
13 views

DAA Quick Sort

Daa quick sort

Uploaded by

pavanrajput1701
Copyright
© © All Rights Reserved
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
You are on page 1/ 2

import java.util.

*;

class RandomizedQsort
{
static void random(int arr[],int low,int high)
{

Random rand= new Random();


int pivot = rand.nextInt(high-low)+low;

int temp1=arr[pivot];
arr[pivot]=arr[high];
arr[high]=temp1;
}

static int partition(int arr[], int low, int high)


{
random(arr,low,high);
int pivot = arr[high];

int i = (low-1); // index of smaller element


for (int j = low; j < high; j++)
{
// If current element is smaller than or
// equal to pivot
if (arr[j] < pivot)
{
i++;

// swap arr[i] and arr[j]


int temp = arr[i];
arr[i] = arr[j];
arr[j] = temp;
}
}

// swap arr[i+1] and arr[high] (or pivot)


int temp = arr[i+1];
arr[i+1] = arr[high];
arr[high] = temp;

return i+1;
}
static void sort(int arr[], int low, int high)
{
if (low < high)
{
int pi = partition(arr, low, high);
sort(arr, low, pi-1);
sort(arr, pi+1, high);
}
}
static void printArray(int arr[])
{
int n = arr.length;
for (int i = 0; i < n; ++i)
System.out.print(arr[i]+" ");
System.out.println();
}

// Driver Code
public static void main(String args[])
{
int arr[] = {10, 7, 8, 9, 1, 5};
int n = arr.length;

sort(arr, 0, n-1);

System.out.println("Sorted array");
printArray(arr);
}
}

Output
Sorted array:
1 5 7 8 9 10

You might also like