Logo 
Search:

Java Articles

Submit Article
Home » Articles » Java » Applet programsRSS Feeds

An applet program to perform merge sort

Posted By: Easy Tutor     Category: Java     Views: 4696

Write an applet program to perform merge sort.

Code for An applet program to perform merge sort in Java

import java.io.*;
import java.util.*;   //for working with Vectorsclass MergSort
{
         String str;
         intvalue=0;
         staticint s1=0,s2=0;
         Vector list1 = new Vector();
         Vector list2 = new Vector();
         Integer intval; //object of Integer class for converting primitive numbers to object numbersvoid getdata()
     {
         try{
              System.out.println("\n=====MERGE SORT=====");
              BufferedReader obj=new BufferedReader(new InputStreamReader(System.in));
              System.out.println("\nNOTE :  Data should be entered in sorted order");
              System.out.print("\nEnter size of First List : ");
              System.out.flush();
              str=obj.readLine();
              s1=Integer.parseInt(str);
                 for(int i=0;i<s1;i++)        
                    {
                      System.out.print("Enter value for Element "+(i+1)+" :  ");
                      System.out.flush();
                      str=obj.readLine();
                      value=Integer.parseInt(str);
                      intval = new Integer(value);
                      list1.addElement(intval);
                  }

                System.out.print("\nEnter size of Second List : ");
              System.out.flush();
              str=obj.readLine();
              s2=Integer.parseInt(str);
                  for(    int i=0;i<s2;i++)
                   {
                      System.out.print("Enter value for Element "+(i+1)+" :  ");
                      System.out.flush();
                      str=obj.readLine();
                      value=Integer.parseInt(str);
                      intval=new Integer(value);
                      list2.addElement(intval);
                   }
            }
            catch(Exception e) {}
      }

                   //MERGE LOGICvoid merging()  //method to merg
                    {
                         for(int i=0;i<s2;i++)
                         {
                             list1.insertElementAt(list2.elementAt(i),(s1+i));
                        }
                        System.out.println("\n\nAFTER MERGING");
                        for(int i=0;i<s1+s2;i++)
                        {
                            System.out.println("Element at("+(i+1)+") : "+list1.elementAt(i));
                        }
                   }
                              
                //SORT LOGICvoid sorting() //method for sorting 
                {
                    //creating temporary arrayint size=list1.size();
                    Vector sort=new Vector();
                    int a,b; //extra for converting object to primitive numbers
                    Integer A,B; //extra for taking object valueint first=0,second=s1,third=s1+s2,i,j,c=0;
                   i=first;
                   j=second;
                   while(i<second && j<third)
                   {
                          A=(Integer)list1.elementAt(i);  //Assigning object to object
                          B=(Integer)list1.elementAt(j);  //Assigning object to object

                          a=A.intValue();  //converting object to primitive number
                          b=B.intValue();  //converting object to primitive numberif(a < b)   //list1.elementAt(i)   <    list1.elementAt(j)
                            {
                               sort.insertElementAt(A,c);
                               i++;
                            }
                          else
                            {
                              sort.insertElementAt(B,c);
                              j++;
                            }
                         c++;
                    }

                    if(i<second)
                    {
                          while(i<second)
                          {
                              sort.insertElementAt(list1.elementAt(i),c);
                              i++;
                              c++;
                         }
                    }

                    if(j<third)
                    {
                        while(j<third)
                        {
                              sort.insertElementAt(list1.elementAt(j),c);
                               j++;
                               c++;
                        }
                    }

                    System.out.println("\n\nAFTER SORTING");
                    for(int k=0;k<sort.size();k++)
                          System.out.println("Element at("+(k+1)+") : "+sort.elementAt(k));
            }

}


class  MergSortData
{
    publicstaticvoid main(String[] args) 
    {
         MergSort obj=new MergSort();
         obj.getdata();
         obj.merging();
         obj.sorting();
    }
}

  
Share: 


Didn't find what you were looking for? Find more on An applet program to perform merge sort Or get search suggestion and latest updates.

Easy Tutor
Easy Tutor author of An applet program to perform merge sort is from United States. Easy Tutor says

Hello Friends,

I am Free Lance Tutor, who helped student in completing their homework.

I have 4 Years of hands on experience on helping student in completing their homework. I also guide them in doing their final year projects.

I have share many programs on this website for everyone to use freely, if you need further assistance, than please contact me on easytutor.2ya [at the rate] gmail [dot] com

I have special discount scheme for providing tutor services. I am providing tutor service to students from various contries, currently most of my students are from United States, India, Australia, Pakistan, Germany, UK and Canada.

I am also here to expand my technical network to receive more opportunity in my career, make friends to help them in resolving their technical problem, learn and share my knowledge, If you like to be my friend, Please send me friend request.

Thanks,
Happy Programming :)

 
View All Articles

 
Please enter your Comment

  • Comment should be atleast 30 Characters.
  • Please put code inside [Code] your code [/Code].

 
No Comment Found, Be the First to post comment!