Added Selection Sort Algorithm

[hirentimbadiya]

The selection sort algorithm sorts an array by repeatedly finding the minimum element (considering ascending order) from the unsorted part and putting it at the beginning. The algorithm maintains two subarrays in a given array.

1. The subarray which already sorted.
2. The remaining subarray was unsorted. In every iteration of the selection sort, the minimum element (considering ascending order) from the unsorted subarray is picked and moved to the sorted subarray. Time Complexity: The time complexity of Selection Sort is O(N^2) as there are two nested loops: Auxiliary Space: O(1) Stability : The default implementation is not stable. Selection Sort is in-place sorting algorithm

By submitting this pull request I confirm I've read and complied with the below requirements.

• [x] I have read the Contribution guidelines and I am confident that my PR reflects them.
• [x] I have followed the coding guidelines for this project.
• [x] My code follows the skeleton code structure.
• [x] This pull request has a descriptive title. For example, Added {Algorithm/DS name} [{Language}], not Update README.md or Added new code.