Skip to main content

Quick Sort In Data Structure


   ⇰   QUICK SORT :-
Quick sort is one of the type of sorting technique. It follows the divide and conquer algorithm. The Quick sort treats an array as a list of elements. When sorting process begins, it selects the List's middle element as the list pivote. The algorithm then divides the list into two sub-lists, one with the elements that are less then the list pivote and other list with elements greater then or equal to list pivote. 
 The algorithm then recursively invokes or calls itself with both the list. Each time when the sorting algorithm is invoked, it further divides the elements into smaller sub-lists. This algorithm is quite efficient for large-sized data. In quick Sort generally middle element of list is considered as pivote, but we can  take pivot in different ways as follows:- 
  i > picking first element as pivot.
 ii > picking last element as pivot
iii > Pick a random element as pivot.
iv > Pick middle element as pivot (We are using it in example).

EXAMPLE :-
Let us take a unsorted list :-
          8 11 13 9 52 44 77 66 12



  ⇰  ALGORITHM OF QUICK SORT :-
Function:- QSort( array, first, last) where,
          array:- listof element,
          first:- position of 1st element in list,
          last:- position of last element in list.
Step1 :- Initialize.
               low = first
              high = last
              pivot = arry [ (low + high) /2]

Step2 :- Repeat through step7 
            while ( low <= high)

Step3 :- Repeat step4
           while ( Array[ high] < pivote)

Step4 :- low = low+1

Step5 :- Repeat step6
           while( array [high] < pivote)

Step6 :-  high = high-1

Step7 :- if low <= high
            i> temp = array [low]
           ii> array[low] = array[high]
           iii> array[high] = temp
          iv> low = low+1
          v> high = high -1

Step8 :- if  first < high
         QSort ( array, first, high)

Step9 :- if first < last
          QSort ( array, low, last)

Step10 :- Exit.



  ⇰  PROGRAM OF QUICK SORT :- 
# include <stdio.h>
# include <conio.h>

void Qsort(int array[ ] , int first , int last)
{
   int temp, low, high, pivot;
       low = first;
       high = last;
   pivot = array [ (first + last) /2];

do
   {
        while ( array [ low ] < pivote )
           {
                low ++ ;
           }
      while ( array [ high ] > pivote)
          {
                high -- ;
          }
    
if ( low <= high )
     {
         temp = array [ low ];
         array [low ++ ] = array [ high ];
         array [ high-- ] = temp;
      }
    } while ( low <= high) ;

    if ( first < high)
           Qsort ( array, first, high)
   if ( low < last)
          Qsort ( array, low, last)
}   

 void main ()
  {
      int value [5] , i;
      printf(" \n Enter values for sort:- ");
        for( i = 0 ; i < 5 ; i++)
       {
          scanf("%d", & value[i] );
       }
  Qsort (value, 0, 4);
  printf( "\n Sorted value :- ");
     for( i =0 ; i< 4; i++) 
    {
         printf(" \t %d" , value [i]);
    }
     getch();
}

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

Comments

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 share system resources  to achieve  multiprogramming .  There are  mainy three types of pro

Tokens and its types in 'C'

   Tokens are the smallest individual unit of a program or in simple words it is a main part of C program.Tokens are the building blocks of any program. The smallest individual and basic unit of a C programming is called c tokens.      *    Normally there are six types of tokens in C:- i> Keywords:-          Keywords are special words that are used to give a special meaning to the program and can't be used as variable and constant.They are basically a sequence of characters that have fixed to mean. For example:-                 auto     double      long     break                 float    short        char     if                while    continue   int       void etc. All keywords must be written in lower case.It is 32 in number. ii> Identifiers:-         The identifiers are basically a token. It can be a variable's name or a label's name. So identifiers are actually a user defined data. But there are certain rules to frame an identifier. They are as follo

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 types:-  i> System  Process. ii> User Process. Early computers allowed only one program be ex