Ask your own question, for FREE!
Computer Science 18 Online
OpenStudy (anonymous):

//==========Start============ Let N be the number of items in the list FOR counter FROM 1 to N BY 1 I = 1 WHILE (I < N) repeat the following: IF the Ith number in the list is greater than the (I+1)th number then: Swap the Ith and (I+1)th numbers in the list ENDIF Add 1 to I ENDWHILE ENDFOR Print out the list //==========END=============== 1. Explain what this algorithm does? 2. What output does the algorithm give on input { 4, 3, 2, 1 } as the list? 3. What output does the algorithm give on input { 9, 10, -4, 9 } as the list?

OpenStudy (anonymous):

1.arranging the list in ascending order. 2.output will be {1,2,3,4} 3.output will be {-4,9,9,10}

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!