Merge pull request #1 from phyex0/sortingAlgorithms

Insertion sort added.

Author: phyex0

.gitignore

@@ -3,4 +3,4 @@
 /Data Structures & Algorithms.iml/
 /.idea/
 /DataStructures-Algorithms.iml/
-
+DataStructures-Algorithms.iml/

src/com/company/Algorithms/BinarySearch.java

@@ -13,7 +13,7 @@
 
 public class BinarySearch {
 
- public static int binarySearch(int[] arr, int val) {
+ public static int search(int[] arr, int val) {
  int index = -1, left = 0, right = arr.length, mid;
 
  while (right > 1) {

src/com/company/Algorithms/BubbleSort.java

@@ -11,7 +11,7 @@
 
 public class BubbleSort {
 
- public static void bubbleSort(int[] arr) {
+ public static void sort(int[] arr) {
  int len = arr.length;
 
  for (int i = 0; i < len - 1; i++) {

src/com/company/Algorithms/InsertionSort.java

@@ -0,0 +1,24 @@
+package com.company.Algorithms;
+
+/*
+ *
+ * Best case : o(n) where all sorted.
+ * Worst case : o(n^2)
+ * Average case : o(n^2)
+ *
+ */
+
+
+public class InsertionSort {
+
+ public static void sort(int[] arr) {
+ for (int i = 1; i < arr.length; i++) {
+ int key = arr[i];
+ //Insert arr[i] into sorted sequence.
+ int j = i - 1;
+ while (j >= 0 && arr[j] >= key)
+ arr[j + 1] = arr[j--];
+ arr[j + 1] = key;
+ }
+ }
+}

src/com/company/Algorithms/LinearSearch.java

@@ -10,7 +10,7 @@
  */
 public class LinearSearch {
 
- public static int linearSearch(int[] arr, int val) {
+ public static int search(int[] arr, int val) {
  int index = -1;
  for (int i = 0; i < arr.length; i++)
  if (arr[i] == val) {