Short answers to Q5 for CS 100

Q5 :

1. 0:10:90

2. x = 1 y = 2

3. If the array has one element, then we are done. Otherwise partition the array around a chosen pivot such that elements < pivot are on the left side of the pivot and elements >= pivot are on the other side. Then recursively quicksort both sides.