Answer Posted / srinivsa

void bubbleSort(int numbers[], int array_size)
{
int i, j, temp;

for (i = (array_size - 1); i >= 0; i--)
{
for (j = 1; j <= i; j++)
{
if (numbers[j-1] > numbers[j])
{
temp = numbers[j-1];
numbers[j-1] = numbers[j];
numbers[j] = temp;
}
}
}
}

Which list does not allow duplicates?

884

---

What do you mean by heap order property?

1074

---

How can you insert a node at the end of linked list?

877

---

What is range search?

890

---

What is push and pop in stack?

842

---

What is sorting problem?

898

---

How to print element of Array?

1042

---

What do you mean by recursive definition?

927

---

What is the difference between Array and LinkedList?

1014

---

How do you declare A pointer to array of three chars

1061

---

What is the procedure to insert into a sorted array?

984

---

What is hash value of a string?

896

---

Explain what is binary search?

946

---

Write an algorithm to show various operations on ordered list and arrays

930

---

What is the difference between ienumerable and list?

859

---