First half in ascending, second half in descending

def printOrder(arr,n) :
    # sorting the array
    arr.sort()
    # printing first half in ascending order
    i = 0
    while (i= n / 2 :
        print (arr[j])
        j = j - 1
# Driver code
arr = [5, 4, 6, 2, 1, 3, 8, 9, 7]
n = len(arr)
printOrder(arr, n)