Let L be the list of non-negative integers and K is the search key. The goal...

Transcribed Image Text:

Let L be the list of non-negative integers and K is the search key. The goal is to find K in L. If the K is found, the algorithm returns the index of L, otherwise, it returns -1. Based on the following list: 690125083764 and the K is 7. a) Demonstrate the solution based on Brute Force design strategy (6 Marks) b) Demonstrate the solution based on Divide and Conquer design strategy (6 Marks) c) State how many comparisons done by Brute Force algorithm? (2 Marks) d) State how many comparisons done by Divide and Conquer algorithm? (2 Marks) e) Provide the algorithm (pseudo code) for Divide and Conquer design strategy (4 Marks) Let L be the list of non-negative integers and K is the search key. The goal is to find K in L. If the K is found, the algorithm returns the index of L, otherwise, it returns -1. Based on the following list: 690125083764 and the K is 7. a) Demonstrate the solution based on Brute Force design strategy (6 Marks) b) Demonstrate the solution based on Divide and Conquer design strategy (6 Marks) c) State how many comparisons done by Brute Force algorithm? (2 Marks) d) State how many comparisons done by Divide and Conquer algorithm? (2 Marks) e) Provide the algorithm (pseudo code) for Divide and Conquer design strategy (4 Marks)