Please inplement in PYTHON

Implement badSort from pseudocode to sort an array of integers. The value of should be an input parameter to your program. Implement the algorithm in PYTHON.

The value of should be float(2/3)

Please provide OUTPUT

Please provide COMMENTS.

Consider the following pseudocode for a sorting algorithm, for 0 1. badSort(A0...n-1]) if (n = 2) and (A[0] > A[1]) swap A[O] and A[1] else if (n > 2) m = an] badSort (A[0...m 1]) badSort (A[n m...n - 1]) badSort (A[0...m 1])