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 are linked lists most commonly used for?

490

---

Can you sort a hashset?

527

---

How many parts are there in a declaration statement?

542

---

What are skew trees? For a tree with 4 nodes draw all possible binary? Generalize for n nodes how many binary trees can be drawn?

629

---

Data structure used to implement a menu

626

---

---

Does concurrenthashmap allow null?

487

---

Define hash function?

524

---

What is a pass in bubble sort?

490

---

How many types of sorting algorithms are there?

480

---

What is priority queue in data structure?

486

---

Why is hashset not ordered?

506

---

What is the use of sorting the data?

550

---

What do you mean by recursive definition?

502

---

When is a graph said to be weakly connected?

524

---

What is stack in geography?

471

---