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

What is a matrix?

1166

---

What is data and information explain with example?

1008

---

Is arraylist synchronized?

1040

---

Define an algorithm.

1029

---

Why is quicksort unstable?

1021

---

What are the types of collision resolution strategies in open addressing?

1073

---

Explain the common uses of tree database.

979

---

What does isempty() member method determines?

978

---

Does hashmap sort automatically?

971

---

How do stacks work?

976

---

Is hashtable throw concurrentmodificationexception?

811

---

Why is data structure?

914

---

Explain Array

1028

---

What are the Difference between tcp and udp?

1064

---

Why is arraylist faster than linkedlist?

985

---