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

How do you empty an arraylist?

911

---

What is stable sorting method?

968

---

What are the properties of an algorithm?

962

---

What is the best case for bubble sort?

806

---

List the two important key points of depth first search?

1146

---

Define an equivalence relation?

1035

---

What is the time complexity of hashmap get () and put () method?

826

---

What is the method to find the complexity of an algorithm?

1049

---

Draw the B-tree of order 3 created by inserting the following data arriving in sequence – 92 24 6 7 11 8 22 4 5 16 19 20 78

1546

---

What are the types of sorting?

843

---

What are linear and non linear data structures?

806

---

What is the most used data structure?

849

---

What is the difference between ienumerable and list?

814

---

What are three common types of traversals?

917

---

where do you use double linked list?

1001

---