Skip to content

Create TestBinarySearch.java #878

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

Closed
phuonanhtt wants to merge 3 commits into from
Closed

Create TestBinarySearch.java #878

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
6dfca25
Create TestBinarySearch.java
phuonanhtt Sep 27, 2019
c721d95
Update TestBinarySearch.java
phuonanhtt Sep 27, 2019
ef58de4
Create TestKandaneAlgorithm.java
phuonanhtt Sep 28, 2019
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
36 changes: 36 additions & 0 deletions DynamicProgramming/TestKandaneAlgorithm.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,36 @@
package DynamicProgramming;
import org.junit.Test;
import static org.junit.Assert.assertEquals;

public class TestKandaneAlgorithm {
@Test
public void largestContiguousSumT1() {
int arr[] = new int[]{};
assertEquals(0,KadaneAlgorithm.largestContiguousSum((arr)));
}
@Test
public void largestContiguousSumT2() {
int arr[] = new int[]{-1,0};
assertEquals(0,KadaneAlgorithm.largestContiguousSum((arr)));
}
@Test
public void largestContiguousSumT3() {
int arr[] = new int[]{-1,-1};
assertEquals(-1,KadaneAlgorithm.largestContiguousSum((arr)));
}
@Test
public void largestContiguousSumT4() {
int arr[] = new int[]{-100000,0,100000};
assertEquals(100000,KadaneAlgorithm.largestContiguousSum((arr)));
}
@Test
public void largestContiguousSumT5() {
int arr[] = new int[]{1,2,-3,3};
assertEquals(3,KadaneAlgorithm.largestContiguousSum((arr)));
}
@Test
public void largestContiguousSumT6() {
int arr[] = new int[]{1,2,3,4,-1,3};
assertEquals(12,KadaneAlgorithm.largestContiguousSum((arr)));
}
}
38 changes: 38 additions & 0 deletions Searches/TestBinarySearch.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,38 @@
package Searches;

import org.junit.Test;
import static org.junit.Assert.asertEquals;

public class UnitTestForBinarySearch {
BinarySearch object = new BinarySearch();
@Test
public void test1() {
int arr[] = {2,3,4,6,7,8,9};
int actualResult = object.find(arr,5);
assertEquals(-1,actualResult);
}
@Test
public void test2() {
int arr[] = {2,3,4,5,6,7,8,9};
int actualResult = object.find(arr,5);
assertEquals(5,actualResult);
}
@Test
public void test3() {
int arr[] = {2,3,4,6,7,8,9};
int actualResult = object.find(arr,2);
assertEquals(2,actualResult);
}
@Test
public void test4() {
int arr[] = {2,3,4,6,7,8,9};
int actualResult = object.find(arr,9);
assertEquals(9,actualResult);
}
@Test
public void test5() {
int arr[] = {2,3,4,6,7,8,9};
int actualResult = object.find(arr,3);
assertEquals(3,actualResult);
}
}