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

How to sequentially represent max-heap?

927

---

Why is quicksort not stable?

1009

---

Which collection allows null values?

882

---

How do you create a tree diagram?

1010

---

Is array a collection?

915

---

Can you distinguish between ArrayList and Array?

1079

---

What is Storage Structures and File Structures? Can you show their relation? What are the examples of each? Thanks

2549

---

How would you implement two stacks using a single array?

994

---

Explain extended binary tree.

969

---

Why is sorting important?

872

---

List the applications of stacks?

1067

---

Explain how is linked list implemented?

938

---

Is map a data structure?

926

---

What is difference between arraylist and list?

923

---

State the rules to be followed during infix to prefix conversions?

1047

---