Answers for "selection sort explanation"

selection sort

#include <bits/stdc++.h>

using namespace std; 

void selectionSort(int arr[], int n){
    int i,j,min;
    
    for(i=0;i<n-1;i++){
        min = i;
        for(j=i+1;j<n;j++){
            if(arr[j] < arr[min]){
                min = j;
            }
        }
        if(min != i){
            swap(arr[i],arr[min]);
        }
    }
}

int main()  
{  
    int arr[] = { 1,4,2,5,333,3,5,7777,4,4,3,22,1,4,3,666,4,6,8,999,4,3,5,32 };  
    int n = sizeof(arr) / sizeof(arr[0]);  

    selectionSort(arr, n);  

    for(int i = 0; i < n; i++){
        cout << arr[i] << " ";
    }

    return 0;  
}

selection sort

// C algorithm for SelectionSort

void selectionSort(int arr[], int n)
{
	for(int i = 0; i < n-1; i++)
	{
		int min = i;
        
		for(int j = i+1; j < n; j++)
		{
			if(arr[j] < arr[min])
            	min = j;
		}
        
		if(min != i)
		{
        	// Swap
			int temp = arr[i];
			arr[i] = arr[min];
			arr[min] = temp;
		}
	}
}

selection sort

def ssort(lst):
    for i in range(len(lst)):
        for j in range(i+1,len(lst)):
            if lst[i]>lst[j]:lst[j],lst[i]=lst[i],lst[j]
    return lst
if __name__=='__main__':
    lst=[int(i) for i in input('Enter the Numbers: ').split()]
    print(ssort(lst))

selection sort

#include <iostream>

// findSmallest() function returns the smallest number in the given array
int findSmallest(int* arr, int length) {
	int small = arr[0], smallIndex = 0;
	for (int i = 1; i < length; i++)
		if (arr[i] < small) {
			small = arr[i];
			smallIndex = i;
		}
	return smallIndex;
}

// pop() function remove the smallest number in the given array
void pop(int* arr, int& length, int index) {
	for (int i = index; i < length - 1; i++)
		arr[i] = arr[i + 1];
	length--;
}

// sort() main sorting function that finds and store the smallest number
//			in new array and remove that smallest number
//			and at the end returns the address of new sorted array !
int* sort(int* arr, int length) {
	int* newArr = new int[length], length1 = length;
	for (int i = 0; i < length; i++) {
		int smallest = findSmallest(arr, length1);
		newArr[i] = arr[smallest];
		pop(arr, length1, smallest);
	}
	delete arr;
	arr = nullptr;
	return newArr;
}

int main() {
	int* arr = new int[6]{ 5,5, 3, 6, 2, 10 };
	arr = sort(arr, 6);	// 6 is the length of array
	for (int i = 0; i < 6; i++)
		std::cout << arr[i] << " ";
	return 0;
}