|
Algorithms_in_C++ 1.0.0
Set of algorithms implemented in C++.
|
Implementation for the Union of two sorted Arrays algorithm. More...
#include <algorithm>#include <cassert>#include <iostream>#include <vector>Namespaces | |
| namespace | operations_on_datastructures |
| for std::vector | |
| namespace | tests |
| Testcases to check Reversal of Binary Tree. | |
Functions | |
| void | operations_on_datastructures::print (const std::vector< int32_t > &array) |
| Prints the values of a vector sequentially, ending with a newline character. More... | |
| std::vector< int32_t > | operations_on_datastructures::get_union (const std::vector< int32_t > &first, const std::vector< int32_t > &second) |
| Gets the union of two sorted arrays, and returns them in a vector. More... | |
| void | tests::test1 () |
| < Use the BinaryTree More... | |
| void | tests::test2 () |
| A Test to check an edge case (NULL root element) More... | |
| void | tests::test3 () |
| A Test to check correct reversal of a Binary Tree. More... | |
| void | tests::test4 () |
| A Test to check correct functionality with duplicate values. More... | |
| void | tests::test5 () |
| A Test to check correct functionality with a harder test case. More... | |
| void | tests::test6 () |
| A Test to check correct functionality with an array sorted using std::sort. More... | |
| static void | test () |
| Function to test the correctness of get_union() function. More... | |
| int | main () |
| main function More... | |
Implementation for the Union of two sorted Arrays algorithm.
The Union of two arrays is the collection of all the unique elements in the first array, combined with all of the unique elements of a second array. This implementation uses ordered arrays, and an algorithm to correctly order them and return the result as a new array (vector).
| int main | ( | void | ) |
|
static |
Function to test the correctness of get_union() function.