Facebook

QS safest cryptocurrency exchange

From Tacky Cassowary, 4 Years ago, written in Plain Text.
URL https://pastebin.pl/view/53eb3dfb
Embed
Download Paste or View Raw
Hits: 120
  1. def partition(arr,low,high):
  2.     i = ( low-1 )          
  3.     pivot = arr[high]      
  4.  
  5.     for j in range(low , high):
  6.         if   arr[j] < pivot:
  7.             i = i+1
  8.             arr[i],arr[j] = arr[j],arr[i]
  9.  
  10.     arr[i+1],arr[high] = arr[high],arr[i+1]
  11.     return ( i+1 )
  12. def quickSort(arr,low,high):
  13.     if low < high:
  14.  
  15.         pi = partition(arr,low,high)
  16.         quickSort(arr, low, pi-1)
  17.         quickSort(arr, pi+1, high)
  18.  
  19.  
  20. arr = [10, 7, 8, 9, 1, 5]
  21. n = len(arr)
  22. quickSort(arr,0,n-1)
  23. print ("Sorted array is:")
  24. for i in range(n):
  25.     print ("%d" %arr[i]),
  26.  

Reply to "QS"