Question: 1)Describe using pseudocode an algorithm that takes a list of n integers a1,a2,,an and finds the sum of all positive integers in the list 2)The
1)Describe using pseudocode an algorithm that takes a list of n integers a1,a2,,an and finds the sum of all positive integers in the list
2)The bubble sort algorithm discussed in class is used to sort the following sequence of integers 74 21 57 86 51 85
* how many passes will the algorithm perform to garantee the entire sequence is sorted?
* what is the listed optained after the first pass?
* what is the listed optained after the third pass?
* what is the listed optained after the final pass?
3) show how the binaty search algorithm discussed in class searches for 12 in the sorted list below;
1 8 21 25 31 36 39 40 49 69 92 99
Please help.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
