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

Define the graph data structure?

924

---

What is the difference between linked list and array?

922

---

What stack means?

873

---

what is Linked lists?

949

---

How many sorting are there in data structure?

845

---

Why is the isempty() member method called?

996

---

How do you sort an arraylist?

838

---

Can we create a null as a key for a map collection?

891

---

What are the parts of a linked list?

1014

---

What's the difference between an array and vector?

853

---

How does a hashtable work?

846

---

Define indegree of a graph?

1027

---

Does arraylist have index?

901

---

What are trees in data structures?

887

---

Tell me what is quick sort?

863

---