algorithm/Java
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Java.git synced 2025-07-28 15:02:46 +08:00
Code Issues Packages Projects Releases Wiki Activity

Refactoring BinaryInsertionSort according to common SortAlgorithm approach (#5239)

Browse Source 
* Refactoring BinaryInsertionSort according to common SortAlgorithm approach

* Formatting has been fixed

* Refactoring tests for BinaryInsertionSort according to SortingAlgorithmTest

* Removing redundant tests and improving variable readability

---------

Co-authored-by: alx <alx@alx.com>
Co-authored-by: Piotr Idzik <65706193+vil02@users.noreply.github.com>
This commit is contained in:
Alex K
2024-06-19 19:57:54 +03:00
committed by GitHub
parent bf4fc3f9c2
commit a9db8428b2
2 changed files with 21 additions and 27 deletions
Download Patch File Download Diff File Expand all files Collapse all files

27
src/test/java/com/thealgorithms/sorts/BinaryInsertionSortTest.java
View File

@ -1,27 +1,10 @@
package com.thealgorithms.sorts;
import static org.junit.jupiter.api.Assertions.assertArrayEquals;
class BinaryInsertionSortTest extends SortingAlgorithmTest {
private final BinaryInsertionSort binaryInsertionSort = new BinaryInsertionSort();
import org.junit.jupiter.api.Test;
class BinaryInsertionSortTest {
BinaryInsertionSort bis = new BinaryInsertionSort();
@Test
// valid test case
public void binaryInsertionSortTestNonDuplicate() {
int[] array = {1, 0, 2, 5, 3, 4, 9, 8, 10, 6, 7};
int[] expResult = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
int[] actResult = bis.binaryInsertSort(array);
assertArrayEquals(expResult, actResult);
}
@Test
public void binaryInsertionSortTestDuplicate() {
int[] array = {1, 1, 1, 5, 9, 8, 7, 2, 6};
int[] expResult = {1, 1, 1, 2, 5, 6, 7, 8, 9};
int[] actResult = bis.binaryInsertSort(array);
assertArrayEquals(expResult, actResult);
@Override
SortAlgorithm getSortAlgorithm() {
return binaryInsertionSort;
}
}