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 the use of tree data structure?

648

---

What does simulation of queues mean?

740

---

What is the capacity of arraylist?

647

---

What is doubly linked list?

693

---

Is bucket sort stable?

677

---

Why is concurrenthashmap thread safe?

678

---

State the advantages of using infix notations?

870

---

Define an algorithm. What are the types of algorithms?

692

---

Is radix sort stable?

680

---

Is hashmap a collection?

686

---

What is collection process?

716

---

What are the advantages of linked list over array (static data structure)?

977

---

What is example of data?

721

---

How can we remove loops in a linked list? What are the functions of fast and slow pointers?

871

---

What is inserting in data structure?

689

---