Answer Posted / naveen

Program for Bubble sort*/
#include<stdio.h>
#include<conio.h>
#define max 20
void insert(int [],int);
void display(int [],int);
void sort(int [],int);
void main()
{
int a[max],n;
clrscr();
printf("\n \t Enter the size of array < %d--->",max);
scanf("%d",&n);
insert(a,n);
printf("\n \t Elements before sorting");
display(a,n);
sort(a,n);
printf("\n \t Elements after sorting");
display(a,n);
}
void insert(int a[],int n)
{
int i;
printf("\n \t Enter %d elements-->",n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
}
void display(int a[],int n)
{
int i;
for(i=0;i<n;i++)
printf("\n %d",a[i]);
}
void sort(int a[],int n)
{
int i,j,temp;
for(i=0;i<n-1;i++)
{
for(j=0;j<n-1-i;j++)
{
if(a[j]>a[j+1])as
{
temp=a[j];
a[j]=a[j+1];
a[j+1]=temp;
} }
}}

Enter the size of array < 20---->5

Enter 5 elements--->45
3
78
43
21

Elements before sorting
45
3
78
43
21
Elements after sorting
3
21
43
45
78

Why is data structure important?

537

---

State the demerit of linear representation of binary trees?

488

---

What is data and its type?

498

---

What is dynamic array in excel?

471

---

What is insertion sort technique?

499

---

---

What is the best sorting technique?

504

---

What do you mean by separate chaining?

524

---

How can I study data structures and algorithms?

529

---

How would you reverse characters of an array without using indexing in the array.

510

---

What is a Breadth First Search? Give a few of its applications.

504

---

Is it possible to insert different type of elements in a stack? How?

542

---

What is quick sort?

637

---

What is the height of a binary tree?

507

---

Why do we need sorting?

481

---

Do sets allow duplicates?

557

---