def quickSelect(arr):
    # quickselect is a selection algorithm to find the kth smallest element in an unordered list.  closely related to
    # quicksort sorting algorithm.  Like qicksort it is efficient in practice and has good avg case perf, but has poor
    # worst case perf.
    # https://www.geeksforgeeks.org/quickselect-algorithm/
    # https://en.wikipedia.org/wiki/Quickselect

    pass
