Implement quick sort algorithm in Java

[0xSHSH]

This commit adds a new QuickSort class to the project, providing a basic implementation of the quick sort algorithm. The code includes a quickSort method that takes an integer array and its low and high indices as input, and sorts the array in ascending order using the quick sort algorithm.

Key features:

Quick sort algorithm: Efficiently sorts an array using the divide-and-conquer paradigm.
Partitioning: Employs a partitioning strategy to divide the array into two subarrays and recursively sorts them.
Clear and concise code: The code is well-formatted and easy to understand.
Example usage: The main method demonstrates how to use the quickSort method with different input arrays.