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 dynamic data structure?

1386

---

What do you mean by probing?

960

---

Write program for Quick sort ?

1090

---

State the difference between queues and linked lists?

986

---

Name few classes that implement collection interface?

909

---

Why is treeset sorted?

977

---

How can we reverse the order in the treemap?

871

---

What is dynamic array in excel?

880

---

What is pivot in quicksort?

888

---

Does stringutils isempty check for null?

793

---

How can I learn data structures?

926

---

What is collections singletonlist?

865

---

What is a spanning tree?does the minimum spanning tree of a graph give the shortest distance between any 2 specified nodes?

888

---

Define a priority queue?

1105

---

How would you swap the Kth node from beginning with Kth node from end in a Linked List.

916

---