Selection Sort Algorithm (Java version)

• Demonstrates how a Selection Sort Algorithm works
• The sort algorithm starts with leftmost part of the array
• If the selected value is greater than the value of n (the value being compared), swap it.
• Otherwise, select n and move to next position of elements
• Created to simply practice coding in Java

Created by IasJem