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

Which interfaces are implemented by abstractsequentiallist?

893

---

Define adjacent nodes?

1055

---

Why do we use hashset?

932

---

How does dynamic memory allocation help in managing data?

1524

---

Can we give size to arraylist?

965

---

Why is hashmap faster than treemap?

912

---

What is Jagged Arrays?

970

---

How do you sort an array by value?

859

---

Define graph traversals?

1015

---

Which sorting algorithm uses minimum number of swaps?

869

---

What do you mean by Runtime Error

1014

---

Can sets contain duplicates?

835

---

Do you know what is linear search?

895

---

Explain pre-order and in-order tree traversal.

948

---

Are linked lists considered linear or non-linear data structure?

1017

---