Answer Posted / prashant gupta

#include<stdio.h>
#include<conio.h>

void main()
{
int i,j,t;
int a[7]={5,7,8,1,4,2,9}; // You can use any length

for(i=0;i<6;i++)
{
for(j=i+1;j<6;j++)
{
if(a[i]>a[j])
{
t = a[i];
a[i] = a[j];
a[j] = t;
}
}
printf("The Sorted Array is = %d",a[i]);

getch();
}

What is subtree?

909

---

Is hashset a collection?

929

---

What sort does arrays sort use?

871

---

What is the minimization factor and time complexity of b-tree?

1153

---

What are the goals of data structure?

1235

---

What is the top of a stack?

987

---

What do you mean by collision in hashing?

970

---

Define probing?

1165

---

If you have to store one lakh objects, what will be a better option- a hash map or an array list?

1209

---

an array of size N in which every number is between 1 and N, determine if there are any duplicates in it. You are allowed to destroy the array if you like. [ I ended up giving about 4 or 5 different solutions for this, each supposedly better than the others ].

986

---

Why do we use insertion sort?

861

---

What is the capacity of arraylist?

938

---

What data structure does a binary tree degenerate?

901

---

How does sort function work?

876

---

Is array size dynamic or fixed?

971

---