/* Program to demonstrate Randomized quick sort (recursive) */ #include #include #include void quick(int x[], int lb, int ub) ; int partition(int x[], int lb, int ub) ; void show(int x[], int lb, int ub) ; void main() { int i, n, x[20] ; clrscr() ; printf("Enter the number of elements: ") ; scanf("%d",&n) ; printf("Enter the elements:\n") ; for(i=0; ia) up-- ; if(down