The median of three numbers is the one that has the middle value of all three. In other words, if the three numbers are sorted, the one in the middle is the median.
There are several ways of comparing operations among variable a, b and c to determine which one is the median.
One brute force way is to directly represent verify the following formula:
| def iterative_quicksort(arr): | |
| """ | |
| Iterative quick sort | |
| :param arr: arr to be sorted | |
| :return: | |
| """ | |
| if arr is None or len(arr) <= 1: | |
| return | |
| lo = 0 |
| def find_kth_element(a, lo, hi, k): | |
| if lo >= hi: | |
| return a[lo] | |
| p = partition(a, lo, hi) | |
| if (k-1) == p: | |
| return a[p] |
| # IN PLACE MERGE SORT | |
| def mergesort(arr): | |
| if arr is None or len(arr) <= 1: | |
| return arr | |
| _mergesort(arr, 0, len(arr)-1) |
