This Paper proposes an efficient Quick Sort algorithm for sorting a large array. Quick Sort has proved to be the fastest sorting algorithm used for sorting, making O (n log n) comparisons to sort n items. The proposed algorithm is based on a dynamic pivot selection to enhance the average case and eliminate the worst case behavior of the original Quick Sort. The suggested QSort is data-dependent to increase the chances of splitting the array into relatively equal sizes. The algorithm is smart enough to recognize a sorted array that doesn’t require further processing.