Question

Quicksort of an array in PYTHON

For this problem, you will need to generate arrays of 1000 to 10000 3 or 4 digit integers, sort them and also print out the execution time it took to compile.

Answer 1

from random import randint
import time

def partition(arr,start,end):#set the correct index of the last index of value and return the index
   x = arr[end]
   i=start-1
   for j in range(start,end):
       if(x>=arr[j]):
           i+=1
           temp=arr[i]
           arr[i]=arr[j]
           arr[j]=temp
   temp=arr[end]
   arr[end]=arr[i+1]
   arr[i+1]=temp
   return i+1

def quicksort(arr,start,end):
   if(start<end):
       mid=partition(arr,start,end)#the partition function set the value at the correct index
       quicksort(arr,start,mid-1)#call the same function for the left side
       quicksort(arr,mid+1,end)#call the same function for the right side

if __name__ == "__main__":
   L=[0]*1000 #create a array(list) of 1000
   for i in range(1000):
       L[i]=randint(100, 10000)#fill by 3 or 4 integers
   print(L)
   n = len(L)
   start_time = time.time()
   quicksort(L,0,n-1)
   end_time = time.time()
   print("After sort the L")
   print(L)
   print("the sort time of array is: ",end_time-start_time)

Output is so long so i print only the time to sort of the array

the sort time of array is: 0.006806135177612305 ***Repl closed***