Code required_ positive integer decompose, find an algorithm to find the number of non-negative number division, or decomposition. The complexity is O(n^2). Example 1: Input: 4 Output: 5 Explaination: 4=4 4=3+1 4=2+2 4=2+1+1 4=1+1+1+1 Example : Input: 7 Output: 15 Explaination: 7=7 7=6+1 7=5+2 7=5+1+1 7=4+3 7=4+2+1 7=4+1+1+1 7=3+3+1 7=3+2+2 7=3+2+1+1 7=3+1+1+1+1 7=2+2+2+1 7=2+2+1+1+1 7=2+1+1+1+1+1 7=1+1+1+1+1+1+1.

The Bubble Sort procedure bubblesort(a1,a2,...,an: real numbers with n>1) for i:=1 to n-1 for j:=1 to n-i   if aj>aj+1 then interchange aj and aj+1 _____________________________________________ Show how this algorithm works on the input sequence 3, 6, 1, 4, 2. What sequence do we have after the first pass (with i=1)? Make sure that you give the current state of the sequence after every pass.

Question 5: Professor Bond has developed the following algorithm that he claims is going to be a break through in computer science. 1 23400 HER 2 { 6 7 8 9 10 11 Assuming array is zero indexed, A[0] is the first and A[n-1] is the last element, the algorithm is as follows: mystery Function (A, n) 12 13 } int last Pos=n-1; while (last Pos > 0) { } int maxPos=0; for (int i=0; i A[maxPos]) i; maxPos = swap (A, maxPos, lastPos); last Pos last Pos - 1; - Given all of this, answer the following questions. Explain what the algorithm does in plain English. Why does the while loop in the algorithm's pseudocode iterate over all ele- ments but the last, rather than for all elements? (c) (d) What is the best-case of this algorithm? What is the (...) bound on the running time of the best-case of this algorithm? What is the worst-case of this algorithm? What is the (...) bound on the running time of the worst-case of this algorithm?

in c++ using only binary search