Selection Sort

 Let's begin!

Selection Sort is a Sorting Algorithm which has two parts:

1. Find the minimum element in the list within the given range.
2. Swapping the present element with the present minimum element.

One function will returns the smallest element's index within the given range and another element will swap the element with minimum element.

	#include <iostream>
	void print(int *arr)
	{
	for(int i=0; i<=sizeof(arr)+1; i++)
	{
	std::cout<<arr[i]<<" ";
	}
	std::cout<<"\n";
	}
	int min(int *arr ,int low = 0)
	{
	int min = arr[low];
	int index = low;
	for(int i = low; i<= sizeof(arr)+1; i++)
	{
	if (arr[i] < min)
	{
	min = arr[i];
	index = i;
	}
	}
	return index;
	}
	int *selection_sort(int *arr)
	{
	for(int i=0; i<=sizeof(arr)+1; i++)
	{
	int smallest = min(arr, i);
	int temp = arr[i];
	arr[i] = arr[smallest];
	arr[smallest] = temp;
	}
	return arr;
	}
	int main()
	{
	int length;
	std::cout<<"Size of Array: ";
	std::cin>>length;
	int arr[length];
	std::cout<<"Enter Elements:\n";
	for(int i=0; i<length; i++)
	{
	std::cin>>arr[i];
	}
	//int arr[5] = {2,3,4,5,1};
	std::cout<<"Input Array: ";
	print(arr);
	int result = min(arr);
	int *res = selection_sort(arr);
	std::cout<<"Sorted Array: ";
	print(res);
	return 0;
	}

view raw selection_sort.cpp hosted with ❤ by GitHub

	package Algorithms.Sort;
	import java.util.Scanner;
	public class SelectionSort {
	public static void print(int arr[], int length)
	{
	System.out.print("Sorted Array: ");
	for(int i=0; i<length; i++)
	{
	System.out.print(arr[i] + " ");
	}
	System.out.println("");
	}
	public static int minElement(int arr[], int low)
	{
	int min = arr[low];
	int index = low;
	for(int i=low; i<arr.length; i++)
	{
	if(arr[i] < min)
	{
	min = arr[i];
	index = i;
	}
	}
	return index;
	}
	public static int selectionSort(int arr[], int length) []
	{
	for(int i=0; i<length; i++)
	{
	int min = minElement(arr, i);
	int temp = arr[i];
	arr[i] = arr[min];
	arr[min] = temp;
	}
	return arr;
	}
	public static void main(String args [])
	{
	Scanner scan = new Scanner(System.in);
	System.out.print("Enter length of the Array: ");
	int length = scan.nextInt();
	int arr [] = new int [length];
	for(int i=0; i<length; i++)
	{
	System.out.print("Enter element "+(i+1)+" : ");
	arr[i] = scan.nextInt();
	}
	scan.close();
	arr = selectionSort(arr, length);
	print(arr, length);
	}
	}

view raw SelectionSort.java hosted with ❤ by GitHub

	def minElement(arr, start, end):
	min_element = arr[start]
	index = start
	for i in range(start, end):
	if arr[i] < min_element:
	min_element = arr[i]
	index = i
	return index
	def selectionSort(arr, length):
	for index in range(length):
	smallest = minElement(arr, index, length)
	arr[index], arr[smallest] = arr[smallest], arr[index]
	return
	if __name__ == "__main__":
	user_input = input("Enter Length of the List: ")
	length = int(user_input)
	arr = []
	for num in range(length):
	user_input = input("Enter Element {} : ".format(num+1))
	arr.append(int(user_input))
	print("Given List : ",arr)
	selectionSort(arr, length)
	print("Sorted List : ",arr)

view raw selection_sort.py hosted with ❤ by GitHub