Answer Posted / arnoldindia

/*QUICK SORT*/
#include<stdio.h>
#include<conio.h>

int split(int [],int,int);
void quicksort(int [],int,int);

void main()
{
int arr[20],n,i;
clrscr();
printf("\nQUICk SORT\n");
printf("Enter the no.of elements:");
scanf("%d",&n);
printf("Enter the elements:");
for(i=0;i<n;i++)
scanf("%d",&arr[i]);
printf("\nArray before sorting:\n");
for(i=0;i<n;i++)
printf("%d\t",arr[i]);
quicksort(arr,0,n);
printf("\nArray after sorting:\n");
for(i=0;i<n;i++)
printf("%d\t",arr[i]);
getch();
}


void quicksort(int a[],int lower,int upper)
{
int i;
if(upper>lower)
{
i=split(a,lower,upper);
quicksort(a,lower,i-1);
quicksort(a,i+1,upper);
}
}

int split(int a[],int lower,int upper)
{
int i,p,q,t;
p=lower+1;
q=upper;
i=a[lower];
while(q>=p)
{
while(a[p]<i)
p++;
while(a[q]>i)
q--;
if(q>p)
{
t=a[p];
a[p]=a[q];
a[q]=t;
}
}
t=a[lower];
a[lower]=a[q];
a[q]=t;
return(q);
}

Compare Queue and Topic ?

1058

---

Is hashtable fail fast?

791

---

How many types of searching are there in data structure?

788

---

Tell me is it better to use a pointer to navigate an array of values, or is it better to use a subscripted array name?

877

---

Why is hashmap used?

894

---

Which sorting does collections sort use?

857

---

Why concurrenthashmap is fail safe?

915

---

Is vector synchronized?

859

---

What are lists?

893

---

List the differences between comparable and comparator interface?

873

---

What method is used to place a value onto the top of a stack?

975

---

Is merge sort better than quick?

848

---

Define linear data structures?

949

---

What are three common types of traversals?

916

---

What is data type with example?

871

---