Answer Posted / cynthia

//Program for implementing Bubble Sort

#include<stdio.h>
#include<conio.h>
void main()
{
int a[20],n,i,p,t;
clrscr();
printf("Enter the array limit");
scanf("%d",&n);
printf("\nEnter %d elemts",n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
for(i=0;i<n;i++)
{
p=0;
while(p<n-i)
{
if(a[p]>a[p+1])
{
t=a[p];
a[p]=a[p+1];
a[p+1]=t;
}
p++;
}
}
for(i=0;i<n;i++)
printf("%5d",a[i]);
getch();
}

What is difference between arraylist and linkedlist?

1034

---

List the applications of set adt?

906

---

Does arraylist contain duplicates?

886

---

Mention the advantages of representing stacks using linked lists than arrays?

912

---

Is it possible to increase size of array?

951

---

What is the use of data structure?

918

---

Does arraylist have a tostring?

876

---

What are the basic data structures?

973

---

What is the difference between array list and vector list?

895

---

Which interface treemap implements?

964

---

Can we change load factor of hashmap?

878

---

How do treesets work internally?

919

---

What is different between array and list?

915

---

Traverse the given tree using Inorder, Preorder and Postorder traversals. Inorder : D H B E A F C I G J Preorder: A B D H E C F G I J Postorder: H D E B F I J G C A

1065

---

Which sort algorithm is best?

909

---