DSA-with-Go
DSA-with-Go copied to clipboard
Randomize pivot value in implementation of quick sort algorithm,
Currently, the last element is always picked as the pivot. Randomize this such that the pivot is a random number between the "start" and "end" indices passed to the partition function. Test your solution properly before opening a PR.