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();
}

Why hashtable is faster than arraylist?

693

---

What actions are performed when a function returns?

666

---

Define Data Structures?

740

---

Explain the term tail recursion?

759

---

How do you empty an arraylist?

664

---

What is a simple path?

699

---

Explain about set and their types in a collection?

625

---

What is inserting in data structure?

682

---

Does treeset allow duplicates?

626

---

Is bubble sort adaptive?

659

---

Explain in brief a linked list.

701

---

Explain Stack

738

---

Define 2-3 tree?

715

---

What is sorting in data structure?

657

---

What is sort function?

672

---