This is an Visual Basic Assignment comprising only 2 questions. I would like you to accomplish this assignment within 10 hours. It shouldn't take a long time to do this.
<p>Consider the following algorithm to sort 'n' integers in arrayA[1...n].</p><p>First, find the smallest element and swap it with A[1].<br/>Next, find the second smallest element and swap it with A[2].</p><p>Repeat the