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 do you mean by garbage collection?

896

---

Define graph?

1061

---

What is stable sort?

957

---

What is a sorting algorithm in data structure?

875

---

What is a circular singly linked list?

869

---

Complete structure of hashmap, very detail description, along with the basic coding of the hashmap internal implementation.

1051

---

How to get the index of an array element?

1009

---

Is a list an array?

793

---

What are basic algorithms?

856

---

What is a spanning tree in data structure?

915

---

What do you mean by articulation point?

943

---

What do you mean by disjoint set adt?

920

---

How many types of linked list are there?

799

---

What is advantage and disadvantage of linked list?

812

---

Which sorting is stable?

853

---