Sheffield Hallam University Implement Binary Search & Implement Merge Sort Project

Binary Search Algorithm Student: Mark: 0 Is there a generalised Method that iteratively searches the array between a set of low and high indexes? Is there an overload to the generalised iterative Method that searches the whole array? Is there a generalised Method that recursively searches the array between a set of low and high indexes? Is there an overload to the generalised recursive Method that searches the whole array? Use of methods: You must rationalise and encapsulate sesnsible methods. In doing so, consider the blicks of code that would be used by more than one algorithm and method. Also consider what blocks of code are not about the Search algorithm and must not leak into the Search methods. Testing: Your Program.cs should must be set up to run the test without any interaction with the user. It must provide information to demonstrate that the algorithm is working such as a print of the random array, what value is searched for and presentation of return. 40 10 25 5 /10 /10 0 Merge Sort Algorithm Student: Mark: 0 Sort method that sorts the array between a set of low and high indexes Testing: Your Program.cs should must be set up to run the test without any interaction with the user. It must provide information to demonstrate that the algorithm is working such as a print of the random array, and then the sorted array. Sort Mark Criteria Effectiveness of algorithm (Does it work?): Separates algorithm into two methods; Sort and Merge: Elegance of the solution: Consider the following statements in this regard: • Conciseness is a factor though not at cost to readability. A nice code solution is one that is not necessarily the most concise albeit .. • Conciseness is a factor and at times, making it concise makes it more readable. • Reusability – It should work like a Blackbox with clear interface to the Blackbox and what is expected back from Blackbox (In this case, returning void is better than returning some other Type). Clear, sensible terms used for method name, parameter names, method names. Think about the caller (Other client code that will be calling this code). Merge Sort Algorithm high indexes est without any interaction with the user. It must provide uch as a print of the random array, and then the sorted Sort Mark Criteria Effectiveness of algorithm (Does it work?): Separates algorithm into two methods; Sort and Merge: in this regard: A nice code solution is one that is not necessarily the most kes it more readable. rface to the Blackbox and what is expected back from g some other Type). Clear, sensible terms used for method aller (Other client code that will be calling this code). 90 /10 60 20 /10 0 Binary Search Algorithm Student: Mark: 0 Is there a generalised Method that iteratively searches the array between a set of low and high indexes? Is there an overload to the generalised iterative Method that searches the whole array? Is there a generalised Method that recursively searches the array between a set of low and high indexes? Is there an overload to the generalised recursive Method that searches the whole array? Use of methods: You must rationalise and encapsulate sesnsible methods. In doing so, consider the blicks of code that would be used by more than one algorithm and method. Also consider what blocks of code are not about the Search algorithm and must not leak into the Search methods. Testing: Your Program.cs should must be set up to run the test without any interaction with the user. It must provide information to demonstrate that the algorithm is working such as a print of the random array, what value is searched for and presentation of return. 40 10 25 5 /10 /10 0 Merge Sort Algorithm Student: Mark: 0 Sort method that sorts the array between a set of low and high indexes Testing: Your Program.cs should must be set up to run the test without any interaction with the user. It must provide information to demonstrate that the algorithm is working such as a print of the random array, and then the sorted array. Sort Mark Criteria Effectiveness of algorithm (Does it work?): Separates algorithm into two methods; Sort and Merge: Elegance of the solution: Consider the following statements in this regard: • Conciseness is a factor though not at cost to readability. A nice code solution is one that is not necessarily the most concise albeit .. • Conciseness is a factor and at times, making it concise makes it more readable. • Reusability – It should work like a Blackbox with clear interface to the Blackbox and what is expected back from Blackbox (In this case, returning void is better than returning some other Type). Clear, sensible terms used for method name, parameter names, method names. Think about the caller (Other client code that will be calling this code). Merge Sort Algorithm high indexes est without any interaction with the user. It must provide uch as a print of the random array, and then the sorted Sort Mark Criteria Effectiveness of algorithm (Does it work?): Separates algorithm into two methods; Sort and Merge: in this regard: A nice code solution is one that is not necessarily the most kes it more readable. rface to the Blackbox and what is expected back from g some other Type).