How does a selection sort work for an array?

Question

Aryan Kumar · Answer

Selection sort is a simple algorithm that works by repeatedly finding the minimum element from the unsorted part of an array and swapping it with the first element.
and 
Here is the code for selection sort in C#:-
and 
using System;
public class Program
{
   public static void Main()
   {
       int[] arr = {64, 25, 12, 22, 11};
       SelectionSort(arr);
       Console.WriteLine("Sorted array:");
       foreach (int num in arr)
       {
           Console.Write(num + " ");
       }
   }
   public static void SelectionSort(int[] arr)
   {
       for (int i = 0; i andlt; arr.Length - 1; i++)
       {
           int min_index = i;
           for (int j = i + 1; j andlt; arr.Length; j++)
           {
               if (arr[j] andlt; arr[min_index])
               {
                   min_index = j;
               }
           }
           int temp = arr[i];
           arr[i] = arr[min_index];
           arr[min_index] = temp;
       }
   }
}
and 
Output:-
Sorted array: 11 12 22 25 64
and

Anonymous User · Answer

This selection sort is a fairly intuitive sorting 
algorithm, though not necessarily efficient. Into this process, the smallest element is first located and switched with the element at subscript zero, thereby placing the smallest element in the first position.
The smallest element remaining in the subarray is then located next to subscripts 1 through n-1 and switched with the element at subscript 1, thereby placing the second smallest element in the second position. The steps are repeated in the same manner till the last element. 
and and ORand and and and and and and and and and and and and and and and and and and and and and and and and and and and 
The Selection sort is conceptually the simplest sorting algorithm. These algorithms will find first the smallest element in the array and swap it with the element in the first position, then it will find the second smallest element and exchange it with second position's element in that series, and It will keep doing this until the entire table is sorted. This is called selection sort because it repeatedly selects the next-smallest element and swaps it into the right place.and 
Algorithm for selection sort
selectionSort(array, size)
and  repeat (size - 1) times
and  set the first unsorted element as the minimum
and  for each of the unsorted elements
and  and  if element andlt; currentMinimum
and  and  and  set element as new minimum
and  swap minimum with first unsorted position
end selectionSort
Example (1).
#include andlt;stdio.handgt;
void swap(int *a, int *b)
{
and  int temp = *a;
and  *a = *b;
and  *b = temp;
}
void selectionSort(int array[], int size)
{
and  for (int step = 0; step andlt; size - 1; stepand#43;and#43;)
and  {
and  and  int min_idx = step;
and  and  for (int i = step and#43; 1; i andlt; size; iand#43;and#43;)
and  and  {
and  and  and  if (array[i] andlt; array[min_idx])
and  and  and  and  min_idx = i;
and  and  }
and  and  swap(andarray[min_idx], andarray[step]);
and  }
}
void printArray(int array[], int size)
{
and  for (int i = 0; i andlt; size; and#43;and#43;i)
and  {
and  and  printf(andquot;%d  andquot;, array[i]);
and  }
and  printf(andquot;
andquot;);
}
int main()
{
and  int data[] = {20, 12, 10, 15, 2};
and  int size = sizeof(data) / sizeof(data[0]);
and  selectionSort(data, size);
and  printf(andquot;Sorted array in Acsending Order:
andquot;);
and  printArray(data, size);
}

forum

How does a selection sort work for an array?

Anonymous User

Can you answer this question?

2 Answers

Liked By