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

Mention one advantage and disadvantage of using quadratic probing?

991

---

What is array in data structure with example?

925

---

What is int data type?

933

---

Explain Array of pointers?

954

---

Does concurrenthashmap allow null?

912

---

What is the use of threaded binary tree?

976

---

Define quadratic probing?

1013

---

Does treemap sort on key or value?

877

---

Is array immutable?

883

---

What is time complexity of sorting algorithms?

918

---

How do you declare An array of three pointers to chars

845

---

What is default size of hashmap?

887

---

Differentiate between an array and an arraylist.

1054

---

What are the best data structure courses for gate preparation?

893

---

Which sorting algorithm is best for small data?

853

---