Final Project Plans

[RyanZLiu]

Algorithms: Merge Sort with Binary Search PLAN

• python
• user input for entire list
• Implement a function to take user input for the entire list.
• code a normal merge sort algorithm
• Write functions for merging two sorted halves.
• Ensure the merge sort function is correctly sorting the list.
• implement binary search
• Ensure it can search for an element in the sorted list and return its index.
• use time package to compare merge sort to our merge sort
• Implement timing code to measure and compare the execution time of the standard merge sort and the enhanced merge sort with binary search.