python problem help! thank you

Merge Sort vs Insertion Sort Running time analysis

Generate arrays of size n containing random integer

values from 0 to 10,000 to sort. Use the system clock to record the running times of each

algorithm for ten different values of n where n = 5000, 10000, 15000, 20,000, 25000, 30000, 35000, 40000, 45000, 50,000.

You may need to modify the values of n if an algorithm runs too fast or too slow to collect the

running time data (do not collect times over a minute). Output the array size n and time to the

terminal. Name these new programs insertTime.py and mergeTime.py

Using basic merge sort python program such as

def merge(left, right): if not len(left) or not len(right): return left or right result = [] i, j = 0, 0 while (len(result) < len(left) + len(right)): if left[i] < right[j]: result.append(left[i]) i+= 1 else: result.append(right[j]) j+= 1 if i == len(left) or j == len(right): result.extend(left[i:] or right[j:]) break return result def mergesort(list): if len(list) < 2: return list

And insertion sort python program such as

# Function to do insertion sort def insertionSort(arr): # Traverse through 1 to len(arr) for i in range(1, len(arr)): key = arr[i] # Move elements of arr[0..i-1], that are # greater than key, to one position ahead # of their current position j = i-1 while j >=0 and key < arr[j] : arr[j+1] = arr[j] j -= 1 arr[j+1] = key # Driver code to test above arr = [12, 11, 13, 5, 6] insertionSort(arr) for i in range(len(arr)): print ("%d" %arr[i]) middle = len(list)/2 left = mergesort(list[:middle]) right = mergesort(list[middle:]) return merge(left, right)