Please give me code of randomized quick sort

#1

In which we take random element as a pivot

#2

Please read from this link:

#3

but in this code,we are taking the element as pivot whose position is at last,we are not taking random element as pivot,than how it is randomized quick sort

#4

It is code of ranomized quick sort.We are swapping element at a random index with last and then calling partition with last.So that we don’t have to make the function for different pivot index