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 perfect binary tree?

892

---

What is tree in computer science?

1038

---

List the data structures which are used in rdbms, network data modal, and hierarchical data model.

935

---

Differentiate between hashset and treeset.

1059

---

How does a heap sort work?

965

---

How does insertion sort works?

922

---

What is the capacity of arraylist?

987

---

How do you sort an array by value?

900

---

What are the Difference between tcp and udp?

1064

---

Explain what is the type of the algorithm used in solving the 8 queens problem?

919

---

how to delete first node from singly linked list?

1223

---

How to excel in data structures and algorithms?

999

---

What is application of data structure?

942

---

On clicking a node in a tree, all the adjacent edges are turned on. Calculate min of clicks such that all the edges are turned on.

1016

---

What is the structure of an array?

954

---