1) Develop well-documented pseudo code that finds all the elements of a given array (of any...

 

Transcribed Image Text:

1) Develop well-documented pseudo code that finds all the elements of a given array (of any size n) that are multiple of x. The code must display the indices and the values of these elements. For instance, given an array A: (22, 61,-10, 21, 0, 9, 50, 17, 35, 81,-46, 19, 5, 77) with x as 5, your code should find and display something similar to the following (notice that this is just an example. Your solution must not refer to this particular example): The elements of the array 4 that are multiple of 5 are: Index 2 with value -10 Index 6 with value 50 Index 8 with value 35 Index 12 with value 5 a. Briefly justify the motive(s) behind your design. b. What is the Big-O complexity of your solution? Explain clearly how you obtained such complexity. C. What is the Big-Q complexity of your solution? Explain clearly how you obtained such complexity. d. What is the Big-O space complexity of your solution? 1) Develop well-documented pseudo code that finds all the elements of a given array (of any size n) that are multiple of x. The code must display the indices and the values of these elements. For instance, given an array A: (22, 61,-10, 21, 0, 9, 50, 17, 35, 81,-46, 19, 5, 77) with x as 5, your code should find and display something similar to the following (notice that this is just an example. Your solution must not refer to this particular example): The elements of the array 4 that are multiple of 5 are: Index 2 with value -10 Index 6 with value 50 Index 8 with value 35 Index 12 with value 5 a. Briefly justify the motive(s) behind your design. b. What is the Big-O complexity of your solution? Explain clearly how you obtained such complexity. C. What is the Big-Q complexity of your solution? Explain clearly how you obtained such complexity. d. What is the Big-O space complexity of your solution?