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 data structure and its types?

916

---

Define graph traversals?

1015

---

What is stack explain with diagram?

902

---

Write the algorithm for converting infix expression to postfix expression?

967

---

What you mean by sorting?

924

---

Write a program using mergesort technique.

1008

---

What is difference between map and hashmap?

1027

---

Write a program to sum values of given array.

1031

---

What is a property class?

1021

---

How does hashset maintain order?

953

---

What are the advantages of bubble sort?

966

---

Is data structure a data type?

958

---

What is the difference between Array and LinkedList?

1014

---

What is binary search in data structure?

904

---

Draw a binary Tree for the expression : A * B - (C + D) * (P / Q)

1417

---