Answer Posted / siri

void bubble(int x[],int n)
{
int hold,j,pass;
int switched=true;
for(pass=0;pass<n-1&&switched=true;pass++){
switched=false;
for(j=0;j<n-pass-1;j++)
if(x[j]>x[j+1]){
switched=true;
hold=x[j];
x[j]=x[j+1];
x[j+1]=hold;
}
}
}

Which interfaces are implemented by linkedlist?

943

---

Is bucket sort stable?

887

---

Why do we need linked list?

837

---

What is homogeneous array?

873

---

Why might quick sort might be better than merge sort?

999

---

What is collection process?

977

---

Which is the parent class of printerstatereasons class?

886

---

State the demerit of linear representation of binary trees?

955

---

Explain what do you mean by insertion sort, bubble sort and selection sort? Also, explain the differences among the functionalities of the three sorts.

1089

---

What is frozenset?

909

---

List the data structures which are used in hierarchical data model.

953

---

Different Types of pattern?

977

---

Is hashmap a collection?

908

---

What are the types of bulleted list?

851

---

What is the purpose of sorting algorithms?

989

---