Skip to content

Updated Insertion Sort #85

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 3 commits into from
Aug 20, 2017
Merged

Updated Insertion Sort #85

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
3 commits
Select commit Hold shift + click to select a range
2b02d48
Updated Insertion Sort
varunu28 Aug 20, 2017
2eb75e1
Update InsertionSort.java
varunu28 Aug 20, 2017
96af9a7
Update BubbleSort.java
varunu28 Aug 20, 2017
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion Sorts/BubbleSort.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -9,7 +9,7 @@ class BubbleSort
/**
* This method implements the Generic Bubble Sort
*
* @param array The array to make the binary search
* @param array The array to be sorted
* @param last The count of total number of elements in array
* Sorts the array in increasing order
**/
Expand Down
104 changes: 59 additions & 45 deletions Sorts/InsertionSort.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,49 +1,63 @@
import java.util.Scanner;

/**
* This class implements Insertion Sort
*
* @author Unknown
*
* @author Varun Upadhyay (https://github.com/varunu28)
*
*/
class InsertionSort
{
/**
* Main Method
*
* @param args Command line arguments
*/
public static void main(String[] args)
{
int array[]=new int[6];
Scanner input=new Scanner(System.in);

//Input
System.out.println("Enter any 6 Numbers for Unsorted Array : ");
for(int i=0; i<6; i++)
{
array[i]=input.nextInt();
}

//Sorting
for(int i=0; i<6; i++)
{
int temp=array[i];
int j=i-1;
while(j>=0 && temp<array[j] )
{
array[j+1]=array[j];
j--;
}

array[j+1]=temp;
}

//Output
for(int i=0; i<6; i++)
{
System.out.print(array[i]+"\t");
}
input.close();
}

class InsertionSort {

/**
* This method implements the Generic Insertion Sort
*
* @param array The array to be sorted
* @param last The count of total number of elements in array
* Sorts the array in increasing order
**/

public static <T extends Comparable<T>> void IS(T array[], int last) {
T key;
for (int j=1;j<last;j++) {

// Picking up the key(Card)
key = array[j];
int i = j-1;
while (i>=0 && key.compareTo(array[i]) < 0) {
array[i+1] = array[i];
i--;
}
// Placing the key (Card) at its correct position in the sorted subarray
array[i+1] = key;
}
}

// Driver Program
public static void main(String[] args) {
// Integer Input
int[] arr1 = {4,23,6,78,1,54,231,9,12};
int last = arr1.length;
Integer[] array = new Integer[arr1.length];
for (int i=0;i<arr1.length;i++) {
array[i] = arr1[i];
}

IS(array, last);

// Output => 1 4 6 9 12 23 54 78 231
for (int i=0;i<array.length;i++) {
System.out.print(array[i] + " ");
}
System.out.println();

// String Input
String[] array1 = {"c", "a", "e", "b","d"};
last = array1.length;

IS(array1, last);

//Output => a b c d e
for(int i=0; i<last; i++)
{
System.out.print(array1[i]+"\t");
}
}
}