Skip to main content

Shell Sort In data Structure

   ⇰  SHELL SORT :- 

 Shell sort is also a type of sorting technique.  Shell sort is a highly efficient sorting technique. It is  mainly a variation of insertion sort. This technique takes short shifts , avoids large shifts as in insertion sort. This technique uses insertion sort on a large number of elements, first this technique sorts more  widely spaced elements then sorts the less widely spaced elements. This spacing is known as gap or intervals. 

    The shell sort is named after its developer Donald Shell. This sorting technique works by comparing list elements that are seperated by a specific distance called gap, until the element compared with the current gap are in order, and then divides gap and the process contineous. When the gap is reached to 0 and changes are not possible, then the list is sorted. 

 EXAMPLE :-

           

 ⇰  ALGORITHM OF SHELL SORT :- 

Variable Used :- array= list of element,
                 size= number of element. gap, swap, i, temp= local variables.

Step1 :- Initialize
               gap = size/2

Step2 :- Repeat through step6 
               while ( gap = gap/2)
Step3 :- Initialize
               swap = 0

Step4 :- Repeat through step6
               while ( swap )

Step5 :- Repeat through step6
               for( i= 0, 1, 2,......., i < size-gap)

Step6 :- If array[ i ] > array[ i+gap ]
               i> temp = array [ i ]
               ii> array[ i ] = array[ i + gap ]
              iii> array[ gap + i ] = temp
              iv> swap = 1

Step7 :- Exit.




 ⇰  PROGRAM OF SHELL SORT :- 

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

void Ssort( int array [ ], int size)
 {
   int temp, gap, i, swap;
   gap= size/2;

do
    {
    do
        {
         swap = 0;

    for( i=0 ; i< size-gap ; i++)
      {
        if( array[ i ] > array [ i + gap])
          {
             temp = array [ i ];
             array [ i ] = array [ i + gap ];
             array [ i + gap ] = temp;
             swap = 1;
           }
         }
  
      } while ( swap);
    } while ( gap=gap/2);
}

void main ( )
{
  int value [ 5 ], i;

   for ( i=1 ; i<5 ; i++)
     {
          printf("\n Enter value :- ");
          scanf(" %d", & value [i]);
     }

Ssort( value , 5);
printf("\n After sorting :-");

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

getch( );
}

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


Labels:

Comments

Post a Comment

Please comment.

Popular posts from this blog

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...
8 comments
Read more

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 ...
Post a Comment
Read more

Logical VS Physical Address Space In Operating System

Basically an address generated by the CPU is commonly referred  as a logical address, whereas an address seen by the memory unit is commonly referred as a physical address.The compile-time and load-time address-binding methods generate identical logical and physical addresses. However, the execution-time address binding scheme results in differing logical and physical addresses. In this case, we usually refer to the logical address as a virtual address. The set of all logical addresses generated by a program is a logical address space. The set of all physical addresses corresponding to these logical addresses is a physical address space. Thus, in the execution-time address-binding scheme, the logical and physical address spaces differ. The run-time mapping from virtual to physical addresses is done by a hardware device called the memory-management unit (MMU). The user program generates only logical addresses and thinks tha...
Post a Comment
Read more