Added Insertion Sort custom implementation

Added draft of Insertion Sort

Move test to specific class

Author: zevolution

src/main/java/br/com/zevolution/algorithms/sorting/insertionsort/InsertionSort.java

@@ -0,0 +1,27 @@
+package br.com.zevolution.algorithms.sorting.insertionsort;
+
+public class InsertionSort {
+
+	public static Product[] sortingByCheapest(Product[] products, int length) {
+		Product[] array = products.clone();
+		for (int current = 1; current < length; current++) {
+			int beingAnalyzed = current;
+
+			while (beingAnalyzed > 0) {
+				int previousBeingAnalyzed = beingAnalyzed - 1;
+
+				Product currentProductBeingAnalyzed = array[beingAnalyzed];
+				Product previousProductBeingAnalyzed = array[previousBeingAnalyzed];
+				if (currentProductBeingAnalyzed.getPrice() < previousProductBeingAnalyzed.getPrice()) {
+					array[beingAnalyzed] = previousProductBeingAnalyzed;
+					array[previousBeingAnalyzed] = currentProductBeingAnalyzed;
+
+					beingAnalyzed--;
+				} else {
+					break;
+				}
+			}
+		}
+		return array;
+	}
+}

src/main/java/br/com/zevolution/algorithms/sorting/insertionsort/Product.java

@@ -0,0 +1,22 @@
+package br.com.zevolution.algorithms.sorting.insertionsort;
+
+public class Product {
+
+	private String description;
+	private double price;
+
+	public Product(String description, double price) {
+		this.description = description;
+		this.price = price;
+	}
+
+	public double getPrice() {
+		return price;
+	}
+
+	@Override
+	public String toString() {
+		return this.description;
+	}
+
+}

src/test/java/br/com/zevolution/algorithms/sorting/insertionsort/InsertionSortTest.java

@@ -0,0 +1,43 @@
+package br.com.zevolution.algorithms.sorting.insertionsort;
+
+import static org.junit.Assert.*;
+
+import java.util.Arrays;
+
+import org.junit.Before;
+import org.junit.Test;
+
+import br.com.zevolution.algorithms.sorting.insertionsort.Product;
+import br.com.zevolution.algorithms.sorting.insertionsort.InsertionSort;
+
+public class InsertionSortTest {
+
+	private static final double CHEAPEST_PRODUCT = 5;
+	private static final double MOST_EXPENSIVE_PRODUCT = 50;
+	private Product[] products;
+
+	@Before
+	public void init() {
+		Product[] array = {
+				new Product("iMac", MOST_EXPENSIVE_PRODUCT),
+				new Product("iPhone", 8),
+				new Product("Notebook", 7),
+				new Product("Keyboard", 9),
+				new Product("Mouse", CHEAPEST_PRODUCT)
+		};
+		this.products = array;
+	}
+
+	@Test
+	public void should_Get_CheapestProduct() {
+		Product[] ordened = InsertionSort.sortingByCheapest(this.products, this.products.length);
+		assertEquals(CHEAPEST_PRODUCT, ordened[0].getPrice(), 0);
+	}
+
+	@Test
+	public void should_Get_MostExpensiveProduct() {
+		Product[] ordened = InsertionSort.sortingByCheapest(this.products, this.products.length);
+		assertEquals(MOST_EXPENSIVE_PRODUCT, ordened[ordened.length - 1].getPrice(), 0);
+	}
+
+}