Data Structures ---- Sorting (Part - 2 Shell Sort)

Shell Sort

reference: PANIMALAR ENGINEERING COLLEGE NOTES
                 Shell sort was invented by Donald Shell. It improves upon bubble sort and insertion sort by moving out of order elements more than one position at a time.
                 In this sort the whole array is first fragment into K segments, where K is preferably a prime number. After first pass, the whole array is partially sorted. In the next pass, the value of K is reduced which increases the size of the segment and reduces the number of segments.
                 The next K value is chosen as relatively prime to its previous value. The process is repeated until k=1 at which the array is sorted. The insertion sort is applied to each segment, so each successive segment is partially sorted.The shell sort is also called as Diminishing Increment Sort, because the value of K decreases continuously.

Algorithm

void ShellSort (ElementType A[ ], int N)
{
int i,j,Increment;
ElementType temp;
for(Increment = N/2; Increment>0; Increment = Increment/2)
for(i=Increment;i{
temp=A[i];
for(j=i;j>=Increment;j=j-Increment)
if(tempA[j] = A[j- Increment];
else
break;
A[j] = temp;
}
}

Example

Consider an Unsorted array

81      94       11         96        12       35        17        95        28         58

Here N = 10, the first Pass as K = 5 (10/2)

After First Pass

35        17          11           28           12            81             94            95           96           58

In second pass, K is reduced to 3

After Second Pass

28        12         11           35           17                81               58            95             96            94

In third pass, K is reduced to 1

The final sorted array is

11           12          17          28          35            58            81           94            95           96

Analysis of Shell Sort

Worst Case Analysis                          - O(N²)
Best Case Analysis                             - O(N log N)
Average Case Analysis                       - O(N²)

Advantages of Shell Sort

It is one of the fastest algorithm for sorting small number of elements.

It requires relatively small amounts of memory.

(contd)

SOME VERY SIMPLE AND BASIC JAVA SOURCE CODES THAT I DEVELOPED. FEEL FREE TO POINT OUT ERRORS IF ANY.(PART-2)

SOURCE CODE #6
//A SIMPLE JAVA PROGRAM THAT EXPLAINS HIERARCHIAL INHERITANCE

/* HERE InheritanceOne is the base calss, Truck, Airplane & Boat are all derived classes.

 * constructor is used in all the classes.

 * The keyword "extends" is used to show that Inheritance concept is used here.

 * Every method prints a simple line on the screen.

 * The output shows the flow of control throughtout the source code.

 * I hope this explains the concept of hierarchial inheritance very well.

 * Author - Hemapriya Gopal

 */

public class InheritanceOne

{

 float position;

 float speed;

 float fuellevel;

 public InheritanceOne()

 {

        System.out.println("Inside the constructor of the base class");

 }

 public void move()

 {

        System.out.println("Inside the InheritanceOne class move() method ");

 }

 public void addPassenger()

 {

        System.out.println("Inside the InheritanceOne class addPassenger() method ");

 }

 public void displayPosition()

 {

        System.out.println("The position of the vehicle is 45' NE ");

 }

 public void displaySpeed()

 {

        System.out.println("The vehicle is moving at the speed of 60km/hr ");

 }

 public void displayFuellevel()

 {

        System.out.println("The fuel tank in the vehicle is half-full");

 }

 public static void main(String args[])

 {

        InheritanceOne io = new InheritanceOne();

        io.move();

        io.addPassenger();

        Airplane a = new Airplane();

        a.operateUnderCarriage();

        a.displayFuellevel();

        Truck t = new Truck();

        t.getTyrePressure();

        t.displaySpeed();

        Boat b = new Boat();

        b.displayPosition();

        b.dock();

 }

/* InheritanceOne()

{

       System.out.println("Inside the destructor of the base class");

}

*/

}

class Airplane extends InheritanceOne

{

       float heightfromGround;

       public Airplane()

       {

              //super();

              System.out.println("Inside the constructor of the derived class Airplane");

       }

       public void operateUnderCarriage()

       {

              System.out.println("Inside the derived class Airplane in the method operateUndercarriage");

       }

}

class Truck extends InheritanceOne

{

       public void getTyrePressure()

       {

              System.out.println("Inside the method getTyrePressure() of the class Truck");

       }

       public Truck()

       {

              System.out.println("Inside the constructor of the derived class Truck");

       }

}

class Boat extends InheritanceOne

{

       public void dock()

       {

              System.out.println("Inside the method dock() of the derived class Boat");

       }

       public Boat()

       {

              System.out.println("Inside the constructor of the derived class Boat");

       }

}

HIERARCHIAL INHERITANCE

OUTPUT:

Inside the constructor of the base class

Inside the InheritanceOne class move() method

Inside the InheritanceOne class addPassenger() method

Inside the constructor of the base class

Inside the constructor of the derived class Airplane

Inside the derived class Airplane in the method operateUndercarriage

The fuel tank in the vehicle is half-full

Inside the constructor of the base class

Inside the constructor of the derived class Truck

Inside the method getTyrePressure() of the class Truck

The vehicle is moving at the speed of 60km/hr

Inside the constructor of the base class

Inside the constructor of the derived class Boat

The position of the vehicle is 45' NE

Inside the method dock() of the derived class Boat

SOURCE CODE #7

/*A very simple program implementing all the basic concepts of javax.swing

 * Reference - 1.The Complete Refernce 5th Edition --Herbert Schildt

 *          2.NUS - ISS S.E Notes for OOP

 *         3.http://www.wattpad.com/6660884-java-swing-gui-development-chapter-two-your-first

 * Author - Hemapriya Gopal

 */

import java.awt.*;

import javax.swing.*;

public class SwingHelloWorldForPractice

{

       public void FrameOne()

       {

              JFrame frame = new JFrame ("Hello World Application");

              frame.setSize(270,70);

              frame.setLayout(new FlowLayout());

             

              JLabel label = new JLabel ("Hello world");

              JButton button = new JButton ("OK");

              frame.add(label);

              frame.add(button);

             

              frame.setVisible(true);

       }

       public void OddOrEvenUsingGUI()

       {

              String num = JOptionPane.showInputDialog (null,"Enter a number");

              int num1=Integer.parseInt(num);

              if(num1==0)

              {

                     JOptionPane.showMessageDialog (null, "The number entered is zero");

              }

              else if(num1 %2 ==0)

              {

                     JOptionPane.showMessageDialog(null, "The number entered is an even number");

              }

              else

              {

                     JOptionPane.showMessageDialog(null, "The number entered is a odd number");

              }

       }

       public void HelloWorldGUI()

       {

              JOptionPane.showMessageDialog(null,"Hello World!", "Hello",JOptionPane.PLAIN_MESSAGE);

       }

public static void main(String args[])

{

       SwingHelloWorldForPractice shwfp = new SwingHelloWorldForPractice();

       shwfp.HelloWorldGUI();

       shwfp.OddOrEvenUsingGUI();

       shwfp.FrameOne();   

}}

OUTPUT:

SOME VERY SIMPLE AND BASIC JAVA SOURCE CODES THAT I DEVELOPED. FEEL FREE TO POINT OUT ERRORS IF ANY.

SOURCE CODE #1
//A simple program to find the sum of all natural numbers till 100 (0,100)
public class SumTillHundred
{
public static void main(String args[])
{
int i;
int digit;
for (i=1 , digit = 0; i<=100;i++)
{
digit=digit+i;
}
System.out.println("The sum of natural numbers till 100 = " + digit);
}
}

OUTPUT FOR SOURCE CODE #1

The sum of natural numbers till 100 = 5050

SOURCE CODE #2

//A simple program to find the product of all even positive numbers less than ten

public class ProdEvenLessThanTen 

{

public static void main(String args[])

{

int n;

int digit=1;

for(n=2;n<10 n="" p="">

if(n%2==0)

digit=digit*n;

System.out.println("The product of all even numbers less than 10 is " + digit);

}

}

OUTPUT FOR SOURCE CODE #2

The product of all even numbers less than 10 is 384

SOURCE CODE #3

//A Simple java program that reads a line from keyboard and outputs "Hello"+name

import java.io.*;

public class HelloPlusName 

{

public static void main(String args[]) throws java.lang.Exception

{

System.out.println("Enter your name");

BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

String name = br.readLine();

System.out.println("Hello " + name);

}

}

OUTPUT FOR SOURCE CODE #3

Enter your name

Hemapriya

Hello Hemapriya

SOURCE CODE #4

//A simple program that appends firstname with surname and prints the output as "welcome + fullname"

import java.io.*;

import java.lang.String;

public class SurnamePlusFirstname {

public static void main (String args[])throws Exception

{

System.out.println("Enter your firstname \n");

BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

String firstname = br.readLine();

System.out.println("Enter your surname \n");

BufferedReader br2 = new BufferedReader(new InputStreamReader(System.in));

String lastname = br2.readLine();

StringBuilder fullname = new StringBuilder();

fullname.append(firstname); 

fullname.append(lastname);

System.out.println("Welcome " + fullname + "!");

}

}

OUTPUT FOR SOURCE CODE #4

Enter your firstname 

Hemapriya

Enter your surname 

Gopal

Welcome HemapriyaGopal!

SOURCE CODE #5

//Program to find the slope of a straight line in XY- axes when the equation is given

//Assumption: THE SIMPLE CASE THAT THE STRAIGHT LINE INTERSECTS BOTH THE AXES

import java.io.*;

public class SlopeOfStraightLine {

public static void main(String args[]) throws Exception 

{

System.out.println("Enter the equation of the straight line in the two dimensional axes");

BufferedReader br = new BufferedReader(new InputStreamReader (System.in));

String eqn = br.readLine();

System.out.println("Enter the co-efficient of x \n");

BufferedReader br1 = new BufferedReader(new InputStreamReader (System.in));

String str1 = br1.readLine();

float coex = Integer.parseInt(str1);

System.out.println("Enter the co-efficient of y \n");

BufferedReader br2 = new BufferedReader(new InputStreamReader (System.in));

String str2 = br2.readLine();

float coey = Integer.parseInt(str2);

float slope = -(coey/coex);

System.out.println("The straight line having the equation " + eqn + " has the slope value of " + slope + "\n");

}

}

OUTPUT FOR SOURCE CODE #5

Enter the equation of the straight line in the two dimensional axes

2X-3Y+6=0

Enter the co-efficient of x 

2

Enter the co-efficient of y 

-3

The straight line having the equation 2X-3Y+6=0 has the slope value of 1.5