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 best sorting technique?

493

---

What is sorted map?

502

---

What are the difference between malloc() and calloc()?

558

---

What is the best case time complexity of bubble sort?

560

---

What is sorted list in data structure?

488

---

---

What are priority queues?

512

---

Can you dynamically allocate arrays in expanded memory?

624

---

How to excel in data structures and algorithms?

535

---

How is hashmap o 1?

484

---

What is the procedure to insert into a sorted array?

561

---

What are the disadvantages of linked list over array?

464

---

Which sorting technique is best?

525

---

List some applications of multilinked structures?

518

---

How many parts are there in a declaration statement using data structures?

480

---

What are the advantages and disadvantages of linked list?

428

---