Skip to main content

Selection Sort In Data Structure

  ⇰  SELECTION SORT :-

Selection sort is one of the simple type of sorting algorithm. This sorting algorithm is based on In-place comparision of element in the array. In this technique the smallest element is selected from the unsorted array and swapped with the leftmost element. This process continues moving unsorted array boundary by one element to the right. The selection starts from first element and searches the entire list or array until it finds the minimum value in the first place, again selects the second element and searches for the second samllest element. This process continues untill the complete list becomes sort form.This algorithm is not suitable for large data as insertion sort. Its  worst case complexity is Ο(n2), where n is the number of items.

FOR EXAMPLE :-

Let us take a unsorted list :-
     4 3 5 2 1







  ⇰  ALGORITHM OF SELECTION SORT :-

Variable used:-  array= list of element, size= number of element,
      I, J , temp = local variable.

Step1:- Initialize
           I=0

Step :- Repeat through step7 while (I < size -1)

Step3 :-  J= I +1

Step4 :- Repeat through step6 while  ( J < size )

Step5 :- If array [ I ] > array [J ] then,
            i> temp = array [I].
            ii> array [I] = array [J].
           iii> array[J] = temp.

Step6 :- J=J+1

Step7 :- I = I +1

Step8 :- Exit




  ⇰  PROGRAM OF SELECTION SORT IN 'C' :-


# include <stdio.h>
# include <conio.h>

void main()
{
    int  i, j, temp, no[5];
 printf("Enter Values of array for sorting:- ");

for (i = 0 ; i < 5 ; i++)
{
  scanf ( " %d " ,& no[i] );
}

for (i = 0 ; i < 5-1 ; i++)
 {
     for(j=i+1 ; j<5 ; j++)
      {
           if ( no[i] > no[j] )
             {
               temp = no[i];
               no[i] = no[j];
               no[j] = temp;
              }
       }
 }

printf(" \n Sorted value :- ");

for ( i=0 ; i < 5; i++)
 {
    printf(" \n %d" , no[i] );
}

getch();
}

Share, Follow and please comment if you find anything incorrect or to share more information about the topic discussed above.



Comments

Post a Comment

Please comment.

Popular posts from this blog

Process & Its state And process control block :-

                ⇰  PROCESS :- A process can be thought of as a program in execution. Means when any program is executed it becomes process. A processwill need certain resources such as CPU time , memory, files and I/O devices to complete its task. These resources are allocated to the process either when it is created or at the time of execution.             A process is the unit of work in most systems. A system consistes of a collection of processes. All these processes may execute concurrently. Traditionally a process contained only a single thread. Most modern operating ststems now supports processes that have multiple threads.         The operating system is responsible for several important works of process management as - the creation and deletion of process, the schrduling of process, communication and deadlock handling of process. Process is broudly divided into two ...

Process Scheduling And Types of Process Schedular :-

        ⇰ PROCESS SCHEDULING Process Scheduling  is a task  of Operating System that schedules processes of different states like new, ready, waiting, terminated  and running.This scheduling helps in allocation of CPU time for each process, and Operating System allocates the CPU time for each procss. And the process scheduling plays important role to keep the CPU busy all the time.  ⏩   Followings are some objectives of Process Scheduling :-  i > To increase the amount of users within acceptable response times.  ii > To maintain the balance between response and utilization of system. iii > To decrease the enforce priorities and  give reference to the processes holding the key resources.      ⇰  PROCESS SCHEDULAR A scheduler carries out the pro cess scheduling work. Schedulers are often implemented so they keep all computer resources busy and  allows multiple users to shar...

Atomic Transaction In Operating System

All the synchronization techniques we have studied are essentially low level as like semaphores. They require the programmer to involved with all the details of mutual exclusion, critical region management, deadlock prevention, and crash recovery. An abstraction exists there  and is widely used in distributed systems. We will call it an  atomic transaction,  or simply  transaction.   The term  atomic action  is also widely used. The mutual exclusion of critical section ensures that the critical sections are executed automatically. That is, if two critical sections are executed concurrently, the result is equivalent to their sequential execution in some unknown order.   In many cases we would like to make sure that a critical section forms a single logical unit of work that either is performed in its entirely or is not performed at all. An example is funds transfer, in which one account is debited and another is credited. Clearly, it is essential f...