Commit 02a91b7

committed

Implemented Sort interface in InsertionSort and SelectionSort

1 parent be80d09 commit 02a91b7Copy full SHA for 02a91b7

File tree

-5

lines changed

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

-5

lines changed

Lines changed: 3 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,10 +1,11 @@`
`1`	`1`	`package br.com.zevolution.algorithms.sorting.insertionsort;`
`2`	`2`
`3`	`3`	`import br.com.zevolution.algorithms.sorting.Product;`
	`4`	`+import br.com.zevolution.algorithms.sorting.Sort;`
`4`	`5`
`5`		`-public class InsertionSort {`
	`6`	`+public class InsertionSort implementsSort{`
`6`	`7`
`7`		`- public staticProduct[] sortingByCheapest(Product[] products, int length) {`
	`8`	`+ public Product[] sort(Product[] products, int length) {`
`8`	`9`	`Product[] array = products.clone();`
`9`	`10`	`for (int current = 1; current < length; current++) {`
`10`	`11`	`int beingAnalyzed = current;`

Lines changed: 4 additions & 3 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,10 +1,11 @@`
`1`	`1`	`package br.com.zevolution.algorithms.sorting.selectionsort;`
`2`	`2`
`3`	`3`	`import br.com.zevolution.algorithms.sorting.Product;`
	`4`	`+import br.com.zevolution.algorithms.sorting.Sort;`
`4`	`5`
`5`		`-public class SelectionSort {`
	`6`	`+public class SelectionSort implementsSort{`
`6`	`7`
`7`		`- public staticProduct[] sortingByCheapest(Product[] products, int length) {`
	`8`	`+ public Product[] sort(Product[] products, int length) {`
`8`	`9`	`Product[] array = products.clone();`
`9`	`10`	`for (int current = 0; current < length - 1; current++) {`
`10`	`11`	`int cheapest = getCheapest(array, current, length - 1);`
`@@ -18,7 +19,7 @@ public static Product[] sortingByCheapest(Product[] products, int length) {`
`18`	`19`	`return array;`
`19`	`20`	`}`
`20`	`21`
`21`		`- private staticint getCheapest(Product[] products, int beginIndex, int endIndex) {`
	`22`	`+ private int getCheapest(Product[] products, int beginIndex, int endIndex) {`
`22`	`23`	`int cheapest = beginIndex;`
`23`	`24`	`for (int current = beginIndex; current <= endIndex; current++) {`
`24`	`25`	`if (products[current].getPrice() < products[cheapest].getPrice()) {`

Comments

(0)