Assignment #4: Sorting Let us confront QuickSort sorting method. Since the assignment is very similar to the previous two, I will sketch it out in a slightly more compact form.

1. Implement (and test the implementation!) QuickSort.

2. Find in the literature (on the Internet) 3 different methods of selecting the "pivot" element. Implement each of them.

3. Test the QuickSort time efficiency for each of the three pivots, for random, sorted and reverse sorted data strings.

Present the results in the form of a Technical Report.

// For C# language and would very much appreciate help with the technical report as well, Thank you