Please explain. Implement merge sort and insertion sort to sort an array/vector

Question

Please explain.

Implement merge sort and insertion sort to sort an array/vector of integers. You may implement the algorithms in Python, name the programs “mergesort” and “insertsort”. Your programs should be able to read inputs from a file called “data.txt” where the first value of each line is the number of integers that need to be sorted, followed by the integers.

Example values for data.txt:

4 19 2 5 11

8 1 2 3 4 5 6 1 2

The output will be written to files called “merge.out” and “insert.out”.

For the above example the output would be:

2 5 11 19

1 1 2 2 3 4 5 6

Explanation / Answer

def writeToFile(fileName, content): f = open(fileName, 'w') f.write(content) f.close() def merge_sort(sort_list): if len(sort_list) > 1: mid = len(sort_list) // 2 leftHalf = sort_list[:mid] rightHalf = sort_list[mid:] merge_sort(leftHalf) merge_sort(rightHalf) i = 0 j = 0 k = 0 while i

Related Questions

Navigate

• Browse (All)
• Browse P
• Subjects

---