Answer Posted / siya

#include<stdio.h>
#include<conio.h>
void main()
{
int a[20],n,i,j,temp;
printf("\n\nEnter the total number of eleents:");
scanf("%d",&n);
printf("\n\nEnter the array elements:");
for(i=0;i<n;i++)
scanf("%d",&a[i]);
/* sorting */
for(i=0;i<n;i++)
{
for(j=i;j<n-i-1;j++)
{
if(a[j]>a[j+1])
{
temp=a[j+1];
a[j+1]=a[j];
a[j]=temp;
}
}
}
printf("\n\nThe sorted array:");
for(i=0;i<n;i++)
printf("%d ",a[i]);
}

How does threaded binary tree represented in data structure?

1012

---

How many sorting algorithms are there?

996

---

What does simulation of queues mean?

1011

---

What is the difference between for and foreach loop?

973

---

What is data structure and its operations?

849

---

What is a matrix?

1077

---

What is a weighted graph?

1022

---

Why is waste sorting important?

975

---

Difference between arrays and linked list?

943

---

What is subtree?

903

---

Who created quicksort?

979

---

Which is the simplest file structure? (a) Sequential (b) Indexed (c) Random (a) Sequential

1122

---

Is pointer a variable?

896

---

Which method will arrange the element of an array in alphabetical order?

2002

---

Is pointer a variable in data structure?

1281

---