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

What is basic data structure?

898

---

For addition and deletion. Which one is most preferred: array list or linked list?

887

---

What's the difference between a hashtable and a hashmap?

912

---

What is sorting rule in shapes?

886

---

Why using cookie to store session info is a better idea than just using session info in the request?

933

---

How would you sort words in a large file?

904

---

Give one example of right rotation.

932

---

Define graph?

1106

---

Why do we use data structures?

903

---

How expression trees are gets represented in data structure?

863

---

Which language is best for data structures?

957

---

What are control structures?

945

---

What is the slowest sorting algorithm?

907

---

What are the advantages of linked list over array (static data structure)?

1336

---

What is the use of space complexity and time complexity?

1043

---