Construct computer programs to do the following: (1) Finding the Maximum Element in a Finite Sequence...

 

Transcribed Image Text:

Construct computer programs to do the following: (1) Finding the Maximum Element in a Finite Sequence (Algorithm 1). (2) The Linear Search Algorithm (Algorithm 2). (3) The Binary Search Algorithm (Algorithm 3). (4) The Bubble Sort (Algorithm 4). (5) The Insertion Sort (Algorithm 5). (6) Greedy Change-Making Algorithm (Algorithm 6). You must upload (1) your code and (2) an executable to Blackboard. Make sure your code compiles and runs on JDoodle.com, as this is where your code will be tested. Programs which do not compile and run will result in a grade of zero. R-1.15 Perform a similar analysis for method Loop5 shown in Algorithm 1.21. Algorithm Loop1 (n): 8 0 for i- 1 to n do 8+8+1 Algorithm Loop2(n): p-1 for i- 1 to 2n do p-p-i Algorithm Loop3(n): P-1 for i 1 to do p-p-i Algorithm Loop4(n): s 0 fori-1 to 2n do for j1 to i do 8+8+1 Algorithm Loop5(n): 8-0 for i 1 to n do for j1 to i do 8+8+1 Algorithm 1.21: A collection of loop methods. Construct computer programs to do the following: (1) Finding the Maximum Element in a Finite Sequence (Algorithm 1). (2) The Linear Search Algorithm (Algorithm 2). (3) The Binary Search Algorithm (Algorithm 3). (4) The Bubble Sort (Algorithm 4). (5) The Insertion Sort (Algorithm 5). (6) Greedy Change-Making Algorithm (Algorithm 6). You must upload (1) your code and (2) an executable to Blackboard. Make sure your code compiles and runs on JDoodle.com, as this is where your code will be tested. Programs which do not compile and run will result in a grade of zero. R-1.15 Perform a similar analysis for method Loop5 shown in Algorithm 1.21. Algorithm Loop1 (n): 8 0 for i- 1 to n do 8+8+1 Algorithm Loop2(n): p-1 for i- 1 to 2n do p-p-i Algorithm Loop3(n): P-1 for i 1 to do p-p-i Algorithm Loop4(n): s 0 fori-1 to 2n do for j1 to i do 8+8+1 Algorithm Loop5(n): 8-0 for i 1 to n do for j1 to i do 8+8+1 Algorithm 1.21: A collection of loop methods.