Answer Posted / nitin jatpuriya

//PROGRAM FOR BUBBLE SORT

#include<stdio.h>
#include<conio.h>
#define SIZE 5
void main()
{
int a[SIZE],n,i,j,temp;
clrscr();
printf("enter the elements ");
for(i=0;i<SIZE;i++)
scanf("%d",&a[i]);
printf("the sorted list is :->\n");
for(i=0;i<SIZE;i++)
for(j=i;j<SIZE-i;j++)
if(a[j]>a[j+1])
{
temp=a[j];
a[j]=a[j+1];
a[j+1]=temp;
}

for(i=0;i<SIZE;i++)
printf("%d",a[i]);
getch();
}

What is bubble sort algorithm?

1006

---

State the different types of linked lists?

989

---

Why it is said that searching a node in a binary search tree is efficient than that of a simple binary tree?

1021

---

What is difference between capacity and size of arraylist?

1113

---

Discuss the difference between a stack and an Array?

975

---

Define a complete binary tree?

981

---

Why linked list is required?

886

---

Which is faster arraylist or hashmap?

1026

---

What is rule regarding overriding equals and hascode method?

959

---

What are the 4 types of data?

1079

---

Does list allow null values?

976

---

Explain how is linked list implemented?

996

---

Is hashmap get thread safe?

912

---

Define threaded binary tree.

1079

---

Can we use any class as map key?

922

---