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 is entryset in hashmap?

867

---

Does arraylist contain duplicates?

840

---

Write the steps involved in the insertion and deletion of an element in the stack.

1295

---

List out a few of the applications that make use of Multilinked Structures?

1121

---

What are the operations that can be performed on a stack?

874

---

How do I rearrange rows in numbers?

849

---

What is array and its types in data structure?

895

---

How do you empty an arraylist?

917

---

What are the advantages of stack?

806

---

Define a right-skewed binary tree?

892

---

Can the double-checked locking fail on a single processor system?

979

---

Can tuple be sorted?

878

---

Differentiate between hashmap and hashtable.

1060

---

Define an algorithm.

914

---

Explain the common uses of threaded binary tree.

961

---