Kth Largest Element QuickSearch, is a Sorting and Searching related problem and in this post we will see how we can solve this challenge in C++

given an array a and 'k' .Find the kth largest element Can be solved using quick sort like method where we stop when the pivot position is equal to 'k' We use random position for selection pivot element TC: O(nlogn) avg worst : O(n^2)

Please check the main.cpp snippet for the solution.

This solution originally posted at: Github by @susantabiswas