Answer Posted / ganga

all the above programs are wrong!!!

heres a perfect one.. simple logic!

for(i=0;i<n-1;i++)
for(j=i+1;j<n;j++)
{
if(a[i]>a[j])
{
temp=a[i];
a[i]=a[j];
a[j]=temp;
}
}
// now print the elements n see

What is the need for extendible hashing?

977

---

What is data structure and why it is important?

948

---

Does arraylist maintain insertion order?

839

---

What are the topics in data structures?

1012

---

What is the structure of an array?

911

---

Explain extended binary tree.

969

---

Which sorting is best for large data?

940

---

What are the advantages of array?

914

---

What is the main advantage of a linked list?

1000

---

Sorting is not possible by using which of the methods?

922

---

Why are b trees used?

868

---

What is merge sort in daa?

873

---

What are the advantages of bubble sort?

967

---

What happens if we put a key object in a hashmap which exists?

951

---

How many types of priority queue are there?

923

---