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 tree edge?

956

---

Explain what is the bucket size, when the overlapping and collision occur at same time?

1021

---

What is the easiest sorting method to use in data structures?

1067

---

Define double hashing?

939

---

Advanced problems related to Data Structures were asked

920

---

State the properties of a binary tree?

1093

---

Which is faster hashmap or hashtable?

913

---

What does arraylist remove do?

998

---

Is a hashmap a dictionary?

872

---

What is an iterative algorithm?

956

---

What is list data structure?

960

---

Write a program for Sorting an Array. Which sorting will you prefer?

964

---

What is difference between tree and binary tree?

975

---

Can arraylist be resized?

995

---

What are two types of sorting?

1002

---