From 6dfca2503a2aa5e296f430df6ea0cafcfd73152e Mon Sep 17 00:00:00 2001 From: phuonganh98 Date: Fri, 27 Sep 2019 15:40:44 +0700 Subject: [PATCH 1/3] Create TestBinarySearch.java 4 test case for Binary search --- Searches/TestBinarySearch.java | 34 ++++++++++++++++++++++++++++++++++ 1 file changed, 34 insertions(+) create mode 100644 Searches/TestBinarySearch.java diff --git a/Searches/TestBinarySearch.java b/Searches/TestBinarySearch.java new file mode 100644 index 000000000000..fb3692eea69c --- /dev/null +++ b/Searches/TestBinarySearch.java @@ -0,0 +1,34 @@ +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); + } + public void test2() { + int arr[] = {2,3,4,5,6,7,8,9}; + int actualResult = object.find(arr,5); + assertEquals(5,actualResult); + } + public void test3() { + int arr[] = {2,3,4,6,7,8,9}; + int actualResult = object.find(arr,2); + assertEquals(2,actualResult); + } + public void test4() { + int arr[] = {2,3,4,6,7,8,9}; + int actualResult = object.find(arr,9); + assertEquals(9,actualResult); + } + public void test5() { + int arr[] = {2,3,4,6,7,8,9}; + int actualResult = object.find(arr,3); + assertEquals(3,actualResult); + } +} \ No newline at end of file From c721d95dc36caab00fa62f7c60cb54f6ae17ad6e Mon Sep 17 00:00:00 2001 From: phuonganh98 Date: Fri, 27 Sep 2019 16:44:05 +0700 Subject: [PATCH 2/3] Update TestBinarySearch.java --- Searches/TestBinarySearch.java | 4 ++++ 1 file changed, 4 insertions(+) diff --git a/Searches/TestBinarySearch.java b/Searches/TestBinarySearch.java index fb3692eea69c..3a100bab399d 100644 --- a/Searches/TestBinarySearch.java +++ b/Searches/TestBinarySearch.java @@ -11,21 +11,25 @@ public void test1() { 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); From ef58de495deeea59a897e20bbf19f458fdc235fc Mon Sep 17 00:00:00 2001 From: phuonganh98 Date: Sat, 28 Sep 2019 23:50:55 +0700 Subject: [PATCH 3/3] Create TestKandaneAlgorithm.java test case for Kandane Algorithm --- DynamicProgramming/TestKandaneAlgorithm.java | 36 ++++++++++++++++++++ 1 file changed, 36 insertions(+) create mode 100644 DynamicProgramming/TestKandaneAlgorithm.java diff --git a/DynamicProgramming/TestKandaneAlgorithm.java b/DynamicProgramming/TestKandaneAlgorithm.java new file mode 100644 index 000000000000..c734d6e5d583 --- /dev/null +++ b/DynamicProgramming/TestKandaneAlgorithm.java @@ -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))); + } +}