Skip to main content

Merge Sort In data Structure

   ⇰  MERGE SORT :-

Merge sort is also a type of sorting technique. It is mainly based on divide-and-conquer algorithm as quick and merge sort, which breaks down a list into several sub-lists until each sublist consists of a single element and merging those sublists in a manner that results into a sorted list. Merge sort is a sorting technique based on divide and conquer technique. Its  worst-case time complexity is Ο(n log n). 

  It divides input list in two sub-lists, calls itself for the two sub-lists and then merges the two sorted sub-lists. Suppose we have two sub-lists. listA is a list with n element and listB with m element. The operator that combines the element of listA and listB into single result_list with R=n+m elements is called merging.  

  If the elements of listA and listB are in sorted order then we may get a result_list in sorted order. If listA and listB are not in sorted order then we have to make them in sorted order and then both the list can be merged. 

 EXAMPLE :-
     Let us take a list:-
        1  3  5  2  1  6





  ⇰  ALGORITHM MERGE SORT :-
   
Function Used:- Msort( n, listA, m, listB) where,
    n = number of element in listA.
   m = number of element in listB.
   listA = element of listA.
  listB = element of listB.
  result = after merge list.
Step1 :-  Initialize
               i = 0,  j = 0,  k = 0

 Step2 :- Repeat step3 
             while ( i < n and j < m )

Step3 :- If listA[ i ] < listB[ j ]
            i> result[ k ] = listA[ i ]
           ii> i = i +1
          iii> k = k +1

            Else if  listA[ i ] > listB[ j ]
           i> result[ k ] = listB[ j ]
          ii> j = j +1
         iii> k = k +1
       
          Else 
          i> i = i +1
         ii> j = j +1
         iii> k = k +1
      

 Step4 :- Size of listA is larger then listB
              If  i < n 
          

 Step5 :- Repeat  through step5 for 
             l = i, i+1 .... n+1.
             i> result [ k ] = list[ i ]
            ii> i = i +1
           iii> k = k +1

 Step6 :- Size of listB is larger than listA
              If  j < m

 Step7 :- Repeat through step7 for
            l = j, j+1 .... n-1
           i> result[ k ] = listB[ j ]
           ii> j = j + 1
          iii> k = k+1
Step8 :- Exit.


 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 & 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

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

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