Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #Insertion Sort
- import numpy as np
- import time
- A = np.array([0,1,2,3,4]) #sorted
- B = np.array([4,3,2,1,0]) #reverse
- C = np.random.randint(20,size=5) #random size 5
- D = np.random.randint(20,size=10) #random size 10
- E = np.random.randint(20,size=15) #random size 15
- def insertionSort(array):
- print("Original Array =", array)
- counter = 0
- start = time.time()
- #actual sorting
- for j in range(1, len(array)):
- key = array[j]
- i = j-1
- counter += 2
- while (i>=0 and array[i]>key):
- array[i+1] = array[i]
- i = i-1
- counter +=2
- array[i+1] = key
- counter+=1
- end = time.time()
- runTime = end-start
- print("Sorted Array =", array)
- print("Run time =", runTime)
- print("Number of Steps =", counter)
- insertionSort(A)
- insertionSort(B)
- insertionSort(C)
- insertionSort(D)
- insertionSort(E)
- #Selection Sort
- import numpy as np
- import time
- A = np.array([0,1,2,3,4]) #sorted
- B = np.array([4,3,2,1,0]) #reverse
- C = np.random.randint(20,size=5) #random size 5
- D = np.random.randint(20,size=10) #random size 10
- E = np.random.randint(20,size=15) #random size 15
- def selectionSort(array):
- print("Original Array =", array)
- counter = 0
- start = time.time()
- #actual sorting
- for i in range(len(array)):
- min = i
- counter += 1
- for j in range(i+1,len(array)):
- if array[min] > array[j]:
- min = j
- counter += 1
- array[i],array[min] = array[min],array[i]
- counter += 2
- end = time.time()
- runTime = end-start
- print("Sorted Array =", array)
- print("Run time =", runTime)
- print("Number of Steps =", counter)
- selectionSort(B)
- #Bubble Sort
- import numpy as np
- import time
- A = np.array([0,1,2,3,4]) #sorted
- B = np.array([4,3,2,1,0]) #reverse
- C = np.random.randint(20,size=5) #random size 5
- D = np.random.randint(20,size=10) #random size 10
- E = np.random.randint(20,size=15) #random size 15
- def bubbleSort(array):
- print("Original Array =", array)
- counter = 0
- start = time.time()
- #actual sorting
- for i in range(len(array)):
- for j in range(i+1,len(array)):
- if array[i] > array[j]:
- array[i],array[j] = array[j],array[i]
- counter += 2
- end = time.time()
- runTime = end-start
- print("Sorted Array =", array)
- print("Run time =", runTime)
- print("Number of Steps =", counter)
- bubbleSort(D)
Add Comment
Please, Sign In to add comment