Answer Posted / phool chand

Sorting takes place from the pivot value, which is the first value of the given elements, this is marked bold. The values at the left pointer and right pointer are indicated using L and R respectively.

65 70L 75 80 85 60 55 50 45R

Since pivot is not yet changed the same process is continued after interchanging the values at L and R positions

65 45 75 L 80 85 60 55 50 R 70

65 45 50 80 L 85 60 55 R 75 70

65 45 50 55 85 L 60 R 80 75 70


65 45 50 55 60 R 85 L 80 75 70

When the L and R pointers cross each other the pivot value is interchanged with the value at right pointer. If the pivot is changed it means that the pivot has occupied its original position in the sorted order (shown in bold italics) and hence two different arrays are formed, one from start of the original array to the pivot position-1 and the other from pivot position+1 to end.

60 L 45 50 55 R 65 85 L 80 75 70 R

55 L 45 50 R 60 65 70 R 80 L 75 85

50 L 45 R 55 60 65 70 80 L 75 R 85

In the next pass we get the sorted form of the array.

45 50 55 60 65 70 75 80 85

Is it legal to initialize list like this?

1019

---

Can we define the size of arraylist?

975

---

What is example of data?

1197

---

Can we put null key in hashmap?

961

---

Describe full binary tree and complete binary tree.

936

---

Calculate the address of a random element present in a 2d array, given base address as ba.

1577

---

Difference between arraylist and linkedlist?

1062

---

Is there any difference between int[] a and int a[]?

1254

---

If I try to add enum constants to a treeset, what sorting order will it use?

1207

---

What are the disadvantages of circular list?

1015

---

Tell me why can't constant values be used to define an array's initial size

971

---

Which sorting algorithm is worst?

947

---

Is arraylist fail fast?

999

---

What is m way tree in data structure?

1129

---

Does stringutils isempty check for null?

858

---