Sort / Gaurang Jadia

package com.gaurangjadia.code.sorting;

import java.util.Random;

public class ShellSort {

	public Random rdmNumber = new Random();
	public int[] intArray = new int[10];

	public static void main(String[] args) {

		ShellSort object = new ShellSort();

		object.setRandomArray(object.intArray);
		System.out.println("Randomized Array:");
		object.printArray(object.intArray);

		object.intArray = object.doShellSort(object.intArray);
		System.out.println("Sorted Array:");
		object.printArray(object.intArray);
	}

	public int getRandomNumber(){
		int intRandomNumber;
		intRandomNumber = rdmNumber.nextInt(100);
		return intRandomNumber;
	}

	public void setRandomArray(int[] array){
		for(int i=0; i < array.length; i++){
			array[i] = getRandomNumber();
		}
	}

	public int[] doShellSort(int[] array){

		int n = array.length;
		int ino = (int) n / 2;

		while(ino > 0){
			for(int i = ino; i < (n - 1); i++){
				int temp = array[i];
				int j = i;
				while(j >= ino && array[j - ino] > temp){
					array[j] = array[j - ino];
					j = j - ino;
					array[j] = temp;
				}
			}
			ino = (int) (ino / 2.2);
		}
		return array;
	}

	public void printArray(int[] array){
		for(int i=0; i < array.length; i++){
			System.out.print(array[i] + ", ");
		}
		System.out.println("\n");
	}
}

package com.gaurangjadia.code.sorting;

import java.util.Random;

public class ShellSort {

public Random rdmNumber = new Random();

public int[] intArray = new int[10];

public static void main(String[] args) {

ShellSort object = new ShellSort();

object.setRandomArray(object.intArray);

System.out.println("Randomized Array:");

object.printArray(object.intArray);

object.intArray = object.doShellSort(object.intArray);

System.out.println("Sorted Array:");

object.printArray(object.intArray);

}

public int getRandomNumber(){

int intRandomNumber;

intRandomNumber = rdmNumber.nextInt(100);

return intRandomNumber;

}

public void setRandomArray(int[] array){

for(int i=0; i < array.length; i++){

array[i] = getRandomNumber();

}

public int[] doShellSort(int[] array){

int n = array.length;

int ino = (int) n / 2;

while(ino > 0){

for(int i = ino; i < (n - 1); i++){

int temp = array[i];

int j = i;

while(j >= ino && array[j - ino] > temp){

array[j] = array[j - ino];

j = j - ino;

array[j] = temp;

}

ino = (int) (ino / 2.2);

}

return array;

}

public void printArray(int[] array){

for(int i=0; i < array.length; i++){

System.out.print(array[i] + ", ");

}

System.out.println("\n");

}

I was free today and trying to write small code for sorting algorithms. Below code is for the Insertion Sort. I think that it is very easy to understand and if you debug then you can see how algorithm works. I wish that it is helpful.

package sorting;

import java.util.Random;

public class InsertionSort {

	public Random rdmNumber = new Random();
	public int[] intArray = new int[10];
	
	public static void main(String[] args) {
		
		InsertionSort object = new InsertionSort();
		
		object.setRandomArray(object.intArray);
		System.out.println("Randomized Array:");
		object.printArray(object.intArray);
		
		object.intArray = object.doInsertionSort(object.intArray);
		System.out.println("Sorted Array:");
		object.printArray(object.intArray);
	}
	
	public int getRandomNumber(){
		int intRandomNumber;
		intRandomNumber = rdmNumber.nextInt(100);
		return intRandomNumber;
	}
	
	public void setRandomArray(int[] array){
		for(int i=0; i < array.length; i++){
			array[i] = getRandomNumber();
		}
	}
	
	public int[] doInsertionSort(int[] array){
		for(int i=0; i < array.length; i++){
			int intTemp = array[i];
			int j = i -1;
			while(j >= 0 && array[j] > intTemp){
				array[j + 1] = array[j];
				j = j - 1;
			}
			array[j+1] = intTemp;
		}
		return array;
	}
	
	public void printArray(int[] array){
		for(int i=0; i < array.length; i++){
			System.out.print(array[i] + ", ");
		}
		System.out.println("\n");
	}	
}

package sorting;

import java.util.Random;

public class InsertionSort {

public Random rdmNumber = new Random();

public int[] intArray = new int[10];

public static void main(String[] args) {

InsertionSort object = new InsertionSort();

object.setRandomArray(object.intArray);

System.out.println("Randomized Array:");

object.printArray(object.intArray);

object.intArray = object.doInsertionSort(object.intArray);

System.out.println("Sorted Array:");

object.printArray(object.intArray);

}

public int getRandomNumber(){

int intRandomNumber;

intRandomNumber = rdmNumber.nextInt(100);

return intRandomNumber;

}

public void setRandomArray(int[] array){

for(int i=0; i < array.length; i++){

array[i] = getRandomNumber();

}

public int[] doInsertionSort(int[] array){

for(int i=0; i < array.length; i++){

int intTemp = array[i];

int j = i -1;

while(j >= 0 && array[j] > intTemp){

array[j + 1] = array[j];

j = j - 1;

}

array[j+1] = intTemp;

}

return array;

}

public void printArray(int[] array){

for(int i=0; i < array.length; i++){

System.out.print(array[i] + ", ");

}

System.out.println("\n");

}

Download File: InsertionSort

Gaurang Jadia

Nothing is permanent except change

Tag Archives: Sort

Shell Sort

Insertion Sort