# Write a Python Program for BogoSort or Permutation Sort # Python program for implementation of Bogo Sortimport random# Sorts array a[0..n-1] using Bogo sortdef bogoSort(a):    n = len(a)    while (is_sorted(a)== False):        shuffle(a)# To check if array is sorted or notdef is_sorted(a):    n = len(a)    for i in range(0, n-1):        if (a[i] > a[i+1] ):            return False    return True# To generate permutation of the arraydef shuffle(a):    n = len(a)    for i in range (0,n):        r = random.randint(0,n-1)        a[i], a[r] = a[r], a[i]# Driver code to test abovea = [3, 2, 4, 1, 0, 5]bogoSort(a)print("Sorted array :")for i in range(len(a)):    print ("%d" %a[i]),