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 is the difference between dictionary and hashtable?

1110

---

What do you mean by complexity of search algorithm?

778

---

What data structure underlies a python list?

1005

---

How many types of sorting algorithms are there?

934

---

Why is null not allowed in concurrenthashmap?

943

---

which is the simplest file structure? (Sequential, indexed, random)

1316

---

What is the difference between a stack and an array?

1130

---

What is the difference between the hash table and hash map?

1073

---

Define right-in threaded tree?

1017

---

Are dictionaries mutable?

904

---

What is the difference between collections class vs collections interface?

1024

---

How do you access the values within an array?

1114

---

Define hashing?

1076

---

How does a treemap sort?

882

---

What is the need of sorting?

958

---