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

What are the Differences between map and hashmap?

1001

---

What is the best case complexity of quicksort?

901

---

How is any data structure application is classified among files?

1047

---

What is mean by selection sort?

880

---

What is data structure? Explain.

986

---

State the advantages of using postfix notations?

1055

---

When will we get ArrayStoreException?

1164

---

Can we change load factor of hashmap?

880

---

What are the major data structures used in the following areas : network data model & hierarchical data model?

1025

---

What is a multiset table?

858

---

What is the difference between hashmap and treemap?

887

---

What are examples of data structures?

925

---

Are sets sorted?

892

---

What is difference between map and hashmap?

1012

---

Define a Deque?

1047

---