Each question has four choices. More than one options can be correct. When you have finished the quiz, click the button at the end of the questions to view the result, and the solutions and answers.
- Repeat steps 2 and 3 varying from 0 to n-1
- Find the index of the minimum value in a[k] to a[n-1] and store it in m
- Swap a[k] with a[m].
My C/C++ Videos on Youtube
Here is the complete playlist for video lectures and tutorials for the absolute beginners. The language has been kept simple so that anybody can easily understand them. I have avoided complex jargon in these videos.