Selection Sort.

SelectionSort.cpp

void sortArray(vector<int>& nums) {
        
        int lastIndex = nums.size() - 1;
        
        // Run for Every Index except last one as it will be sorted anyways.
        for (int runningIndex = 0;  runningIndex < lastIndex;   runningIndex++){
            
            // Find Minimum/Maximum from running index to lastIndex.
            int min = runningIndex;
                for(int i = runningIndex + 1; i <= lastIndex; i++){
                    if(nums[i] < nums[min]){
                        min = i;
                    }
                }
                
            // Place it in running index. 
            swap(nums[runningIndex], nums[min]);
        }
        
    }
    
    // Finding both max and min and then placing min and max at i and lasstindex-i can be a optimaztion.
    // Complexity will still be O(n^2)