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);
}

What do you mean by linear probing?

1100

---

What is map keyset?

929

---

What is circular queue example?

987

---

Which sorting algorithm uses minimum number of swaps?

917

---

What is priority queue in data structure?

1110

---

What is entryset method in map?

954

---

Do all declaration statements result in a fixed reservation in memory?

982

---

Tell us the difference between merge and quick sort. Which one would you prefer and why?

1068

---

Which method will arrange the element of an array in alphabetical order?

2059

---

Can you tell me the differences between Array and ArrayList?

1096

---

Is arraylist better than array?

1005

---

What is the complexity of adding an element to the heap?

985

---

Define linear data structures?

1049

---

What do you understand by stable sort?

933

---

How do you find the second largest element in an array of integers?

1122

---