TheAlgorithms/C++ 1.0.0
All the algorithms implemented in C++
|
Testcases to check Union of Two Arrays. More...
Functions | |
void | test1 () |
A Test to check an simple case. | |
void | test2 () |
A Test to check an empty vector. | |
void | test3 () |
A Test to check an invalid shift value. | |
void | test4 () |
A Test to check a very large input. | |
void | test5 () |
A Test to check a shift of zero. | |
void | test6 () |
A Test to check correct functionality with an array sorted using std::sort. | |
Testcases to check Union of Two Arrays.
Testcases to check Reversal of Binary Tree.
Testcases to check intersection of Two Arrays.
Testcases to check Circular Linked List.
void tests::test1 | ( | ) |
A Test to check an simple case.
< Use the BinaryTree
A Test to check an edge case (two empty arrays)
A Test to check a single value.
A Test to check an edge case (single element reversal)
< Should print 3 4 5 1 2
< Should print 4 5 1 2 3
< Check if result is empty
< Should only print newline
< Check for equal sizes
< Ensure that there is only one element
< Check if both elements are same
< Check if result is empty
< Should only print newline
< Should print 4 5 1 2 3
< Check if result is empty
< Should only print newline
< Check for equal sizes
< Ensure that there is only one element
< Check if both elements are same
< Check if result is empty
< Should only print newline
Definition at line 75 of file array_left_rotation.cpp.
void tests::test2 | ( | ) |
A Test to check an empty vector.
A Test to check an edge case (NULL root element)
A Test to check an edge case (one empty array)
A Test to check a few values.
< Should print empty newline
< Should print empty newline
< Check if result is equal to a
< Should only print newline
< Check for equal sizes
< Ensure that there is only one element
< Check if result is equal to b
< Should print 2 3
< Should print empty newline
< Check if result is equal to a
< Should only print newline
< Check for equal sizes
< Ensure that there is only one element
< Check if result is equal to b
< Should print 2 3
Definition at line 90 of file array_left_rotation.cpp.
void tests::test3 | ( | ) |
A Test to check an invalid shift value.
A Test to check correct reversal of a Binary Tree.
A Test to check correct functionality with a simple test case.
A Test to check an input array.
< 7 > 5
< Should print empty newline
< 7 > 5
< Should print empty newline
< Check if result is correct
< Should print 6
< Check for equality
< Check for equality
< Check if result is correct
< Should print 2 3 4 6
< 7 > 5
< Should print empty newline
< Check if result is correct
< Should print 6
< Check for equality
< Check for equality
< Check if result is correct
< Should print 2 3 4 6
Definition at line 105 of file array_left_rotation.cpp.
void tests::test4 | ( | ) |
A Test to check a very large input.
A Test to check correct functionality with duplicate values.
A Test to check using a specific Node as the starting point.
< Should print {4, 6, ..., 420, 2}
< Should print {420, 2, 4, ..., 418}
< Node we will start printing from
< Check if result is correct
< Should print 4 6
< Check if result is correct
< Should print 2 3 4 6 7
< Should print {420, 2, 4, ..., 418}
< Node we will start printing from
< Check if result is correct
< Should print 4 6
< Check if result is correct
< Should print 2 3 4 6 7
Definition at line 120 of file array_left_rotation.cpp.
void tests::test5 | ( | ) |
A Test to check a shift of zero.
A Test to check correct functionality with a harder test case.
A Test to check an empty list.
< Should print 1 2 3 4 5
< Should print 1 2 3 4 5
< Check if result is correct
< Should print 2 3 4
< Check if result is correct
< Should print 1 2 3 4 5 6 7 9
< Should print 1 2 3 4 5
< Check if result is correct
< Should print 2 3 4
< Check if result is correct
< Should print 1 2 3 4 5 6 7 9
Definition at line 143 of file array_left_rotation.cpp.
void tests::test6 | ( | ) |
A Test to check correct functionality with an array sorted using std::sort.
< Sort vector a
< Sort vector b
< Check if result is correct
< Should print 3 7
< Sort vector a
< Sort vector b
< Check if result is correct
< Should print 1 2 3 4 5 6 7 8 9 11
< Sort vector a
< Sort vector b
< Check if result is correct
< Should print 1 2 3 4 5 6 7 8 9 11
Definition at line 166 of file intersection_of_two_arrays.cpp.