From 9bcef177415aca21b5f83bb4590c87e6a2ba4342 Mon Sep 17 00:00:00 2001 From: github-actions <${GITHUB_ACTOR}@users.noreply.github.com> Date: Sun, 24 Oct 2021 15:27:02 +0000 Subject: [PATCH] Documentation for 5c9750d97b33fba6a6103a632315578e5feec3cf --- ...tersection__of__two__arrays_8cpp__incl.map | 7 + ...tersection__of__two__arrays_8cpp__incl.md5 | 1 + ...tersection__of__two__arrays_8cpp__incl.svg | 83 ++++ d5/d88/md__d_i_r_e_c_t_o_r_y.html | 2 +- d8/d9c/union__of__two__arrays_8cpp.html | 2 +- ...8dca7b867074164d5f45b0f3851269d_cgraph.map | 2 +- ...8dca7b867074164d5f45b0f3851269d_cgraph.md5 | 2 +- ...8dca7b867074164d5f45b0f3851269d_cgraph.svg | 4 +- ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map | 2 +- ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 | 2 +- ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg | 4 +- ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg | 4 +- d9/df4/namespacetests.html | 69 ++- ...cafde185abd8670abee51157f273dc2_cgraph.map | 2 +- ...cafde185abd8670abee51157f273dc2_cgraph.md5 | 2 +- ...cafde185abd8670abee51157f273dc2_cgraph.svg | 4 +- ...mespaceoperations__on__datastructures.html | 98 +++- ...namespaceoperations__on__datastructures.js | 1 + ...af9a06f0c236c2d95c97e441ea2d12e_cgraph.map | 6 + ...af9a06f0c236c2d95c97e441ea2d12e_cgraph.md5 | 1 + ...af9a06f0c236c2d95c97e441ea2d12e_cgraph.svg | 68 +++ .../intersection__of__two__arrays_8cpp.html | 250 ++++++++++ de/dc5/intersection__of__two__arrays_8cpp.js | 13 + ...8dca7b867074164d5f45b0f3851269d_cgraph.map | 20 + ...8dca7b867074164d5f45b0f3851269d_cgraph.md5 | 1 + ...8dca7b867074164d5f45b0f3851269d_cgraph.svg | 345 ++++++++++++++ ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map | 21 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 | 1 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg | 448 ++++++++++++++++++ ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg | 360 ++++++++++++++ dir_35422be6552f1b3672c1b6c4aba2da64.html | 3 + dir_35422be6552f1b3672c1b6c4aba2da64.js | 1 + files.html | 7 +- globals_func_i.html | 2 +- globals_func_m.html | 2 +- globals_func_t.html | 2 +- globals_i.html | 2 +- globals_m.html | 2 +- globals_t.html | 2 +- namespacemembers.html | 1 + namespacemembers_func.html | 1 + navtreedata.js | 6 +- navtreeindex0.js | 58 +-- navtreeindex1.js | 28 +- navtreeindex10.js | 52 +- navtreeindex11.js | 44 +- navtreeindex12.js | 62 +-- navtreeindex13.js | 60 +-- navtreeindex14.js | 108 +++-- navtreeindex2.js | 50 +- navtreeindex3.js | 40 +- navtreeindex4.js | 84 ++-- navtreeindex5.js | 74 +-- navtreeindex6.js | 56 +-- navtreeindex7.js | 54 +-- navtreeindex8.js | 66 +-- navtreeindex9.js | 56 +-- search/all_14.js | 4 +- search/all_15.js | 6 +- search/all_8.js | 157 +++--- search/all_a.js | 404 ++++++++-------- search/all_e.js | 8 +- search/files_9.js | 7 +- search/functions_13.js | 4 +- search/functions_14.js | 4 +- search/functions_7.js | 143 +++--- search/functions_9.js | 194 ++++---- search/functions_d.js | 4 +- 68 files changed, 2722 insertions(+), 961 deletions(-) create mode 100644 d0/dc8/intersection__of__two__arrays_8cpp__incl.map create mode 100644 d0/dc8/intersection__of__two__arrays_8cpp__incl.md5 create mode 100644 d0/dc8/intersection__of__two__arrays_8cpp__incl.svg create mode 100644 da/d6d/namespaceoperations__on__datastructures_adaf9a06f0c236c2d95c97e441ea2d12e_cgraph.map create mode 100644 da/d6d/namespaceoperations__on__datastructures_adaf9a06f0c236c2d95c97e441ea2d12e_cgraph.md5 create mode 100644 da/d6d/namespaceoperations__on__datastructures_adaf9a06f0c236c2d95c97e441ea2d12e_cgraph.svg create mode 100644 de/dc5/intersection__of__two__arrays_8cpp.html create mode 100644 de/dc5/intersection__of__two__arrays_8cpp.js create mode 100644 de/dc5/intersection__of__two__arrays_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map create mode 100644 de/dc5/intersection__of__two__arrays_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 create mode 100644 de/dc5/intersection__of__two__arrays_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg create mode 100644 de/dc5/intersection__of__two__arrays_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map create mode 100644 de/dc5/intersection__of__two__arrays_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 create mode 100644 de/dc5/intersection__of__two__arrays_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg create mode 100644 de/dc5/intersection__of__two__arrays_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg diff --git a/d0/dc8/intersection__of__two__arrays_8cpp__incl.map b/d0/dc8/intersection__of__two__arrays_8cpp__incl.map new file mode 100644 index 000000000..9275fbda4 --- /dev/null +++ b/d0/dc8/intersection__of__two__arrays_8cpp__incl.map @@ -0,0 +1,7 @@ + + + + + + + diff --git a/d0/dc8/intersection__of__two__arrays_8cpp__incl.md5 b/d0/dc8/intersection__of__two__arrays_8cpp__incl.md5 new file mode 100644 index 000000000..6074d3492 --- /dev/null +++ b/d0/dc8/intersection__of__two__arrays_8cpp__incl.md5 @@ -0,0 +1 @@ +f1cebaaf223769be0b3ed94e96a3a285 \ No newline at end of file diff --git a/d0/dc8/intersection__of__two__arrays_8cpp__incl.svg b/d0/dc8/intersection__of__two__arrays_8cpp__incl.svg new file mode 100644 index 000000000..765aab556 --- /dev/null +++ b/d0/dc8/intersection__of__two__arrays_8cpp__incl.svg @@ -0,0 +1,83 @@ + + + + + + +operations_on_datastructures/intersection_of_two_arrays.cpp + + + +Node1 + + +operations_on_datastructures +/intersection_of_two_arrays.cpp + + + + + +Node2 + + +algorithm + + + + + +Node1->Node2 + + + + + +Node3 + + +cassert + + + + + +Node1->Node3 + + + + + +Node4 + + +iostream + + + + + +Node1->Node4 + + + + + +Node5 + + +vector + + + + + +Node1->Node5 + + + + + diff --git a/d5/d88/md__d_i_r_e_c_t_o_r_y.html b/d5/d88/md__d_i_r_e_c_t_o_r_y.html index 1f99c7e01..e09efd001 100644 --- a/d5/d88/md__d_i_r_e_c_t_o_r_y.html +++ b/d5/d88/md__d_i_r_e_c_t_o_r_y.html @@ -369,7 +369,7 @@ Operations On Datastructures
  • Circular Queue Using Array
  • Get Size Of Linked List
  • Inorder Successor Of Bst
    • -
  • Intersection Of 2 Arrays
    • +
  • Intersection Of Two Arrays
  • Reverse A Linked List Using Recusion
  • Reverse Binary Tree
  • Selectionsortlinkedlist
    • diff --git a/d8/d9c/union__of__two__arrays_8cpp.html b/d8/d9c/union__of__two__arrays_8cpp.html index 6c02a57fd..9043dbcbc 100644 --- a/d8/d9c/union__of__two__arrays_8cpp.html +++ b/d8/d9c/union__of__two__arrays_8cpp.html @@ -224,7 +224,7 @@ Here is the call graph for this function:
    tests::test1
    void test1()
    A Test to check an simple case.
    Definition: array_right_rotation.cpp:76
    tests::test4
    void test4()
    A Test to check a very large input.
    Definition: array_right_rotation.cpp:121
    tests::test3
    void test3()
    A Test to check an invalid shift value.
    Definition: array_right_rotation.cpp:106
    -
    tests::test6
    void test6()
    A Test to check correct functionality with an array sorted using std::sort.
    Definition: union_of_two_arrays.cpp:182
    +
    tests::test6
    void test6()
    A Test to check correct functionality with an array sorted using std::sort.
    Definition: intersection_of_two_arrays.cpp:166
    tests::test2
    void test2()
    A Test to check an empty vector.
    Definition: array_right_rotation.cpp:91
    tests::test5
    void test5()
    A Test to check a shift of zero.
    Definition: array_right_rotation.cpp:144
    diff --git a/d8/d9c/union__of__two__arrays_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/d8/d9c/union__of__two__arrays_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map index 2bcc5eebe..07b5f626a 100644 --- a/d8/d9c/union__of__two__arrays_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map +++ b/d8/d9c/union__of__two__arrays_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map @@ -14,7 +14,7 @@ - + diff --git a/d8/d9c/union__of__two__arrays_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/d8/d9c/union__of__two__arrays_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 index 7e374c3b2..b52adbcc2 100644 --- a/d8/d9c/union__of__two__arrays_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 +++ b/d8/d9c/union__of__two__arrays_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 @@ -1 +1 @@ -7465d70ce9186e0d3ab1409e0072ca90 \ No newline at end of file +10b1db946e79d951113800fd48403960 \ No newline at end of file diff --git a/d8/d9c/union__of__two__arrays_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d8/d9c/union__of__two__arrays_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg index 4613c6bbf..ce0e49f11 100644 --- a/d8/d9c/union__of__two__arrays_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg +++ b/d8/d9c/union__of__two__arrays_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg @@ -286,10 +286,10 @@ Node16 - + operations_on_datastructures -::get_union +::get_intersection diff --git a/d8/d9c/union__of__two__arrays_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d8/d9c/union__of__two__arrays_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map index 4875b727c..58dc6b7eb 100644 --- a/d8/d9c/union__of__two__arrays_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map +++ b/d8/d9c/union__of__two__arrays_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map @@ -15,7 +15,7 @@ - + diff --git a/d8/d9c/union__of__two__arrays_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d8/d9c/union__of__two__arrays_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 index a71c3ac2c..d90727465 100644 --- a/d8/d9c/union__of__two__arrays_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 +++ b/d8/d9c/union__of__two__arrays_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 @@ -1 +1 @@ -5a1cae760a674142a97e17db348ce68d \ No newline at end of file +84596f5dee85d589d1ecc864ef6fa77c \ No newline at end of file diff --git a/d8/d9c/union__of__two__arrays_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d8/d9c/union__of__two__arrays_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg index 2f265601f..df099adb7 100644 --- a/d8/d9c/union__of__two__arrays_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg +++ b/d8/d9c/union__of__two__arrays_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -347,10 +347,10 @@ var sectionId = 'dynsection-1'; Node17 - + operations_on_datastructures -::get_union +::get_intersection diff --git a/d8/d9c/union__of__two__arrays_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d8/d9c/union__of__two__arrays_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg index bb6fa1f51..8b115c859 100644 --- a/d8/d9c/union__of__two__arrays_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg +++ b/d8/d9c/union__of__two__arrays_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg @@ -301,10 +301,10 @@ Node17 - + operations_on_datastructures -::get_union +::get_intersection diff --git a/d9/df4/namespacetests.html b/d9/df4/namespacetests.html index 881169014..2ee0f6d7f 100644 --- a/d9/df4/namespacetests.html +++ b/d9/df4/namespacetests.html @@ -122,7 +122,8 @@ Functions

    Detailed Description

    Testcases to check Union of Two Arrays.

    -

    Testcases to check Reversal of Binary Tree.

    +

    Testcases to check Reversal of Binary Tree.

    +

    Testcases to check intersection of Two Arrays.

    Function Documentation

    ◆ test1()

    @@ -140,16 +141,20 @@ Functions

    A Test to check an simple case.

    -

    A Test to check an edge case (two empty arrays)

    < Use the BinaryTree

    +

    A Test to check an edge case (two empty arrays)

    Returns
    void

    A Test to check an edge case (single element reversal)

    < 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

    +

    < 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

    @@ -195,14 +200,18 @@ Here is the call graph for this function:

    A Test to check an empty vector.

    -

    A Test to check an edge case (one empty array)

    A Test to check an edge case (NULL root element)

    +

    A Test to check an edge case (one empty array)

    Returns
    void

    < 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

    +

    < 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

    @@ -243,15 +252,19 @@ Here is the call graph for this function:

    A Test to check an invalid shift value.

    -

    A Test to check correct functionality with a simple test case.

    A Test to check correct reversal of a Binary Tree.

    +

    A Test to check correct functionality with a simple test case.

    Returns
    void

    < 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

    +

    < Check if result is correct

    +

    < Should print 6

    < Check for equality

    < Check for equality

    < Check if result is correct

    @@ -296,8 +309,12 @@ Here is the call graph for this function:
    Returns
    void

    < Should print {420, 2, 4, ..., 418}

    < Check if result is correct

    +

    < Should print 4 6

    +

    < Check if result is correct

    < Should print 2 3 4 6 7

    < Check if result is correct

    +

    < Should print 4 6

    +

    < Check if result is correct

    < Should print 2 3 4 6 7

    121 {
    122 std::cout << "TEST CASE 4\n";
    @@ -348,8 +365,12 @@ Here is the call graph for this function:
    Returns
    void

    < 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

    < 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

    144 {
    145 std::cout << "TEST CASE 5\n";
    @@ -390,26 +411,34 @@ Here is the call graph for this function:

    < 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

    -
    182 {
    -
    183 std::cout << "TEST CASE 6\n";
    -
    184 std::cout << "Intialized a = {1, 3, 3, 2, 5, 9, 4, 3, 2} ";
    -
    185 std::cout << "b = {11, 3, 7, 8, 6}\n";
    -
    186 std::cout << "Expected result: {1, 2, 3, 4, 5, 6, 7, 8, 9, 11}\n";
    -
    187 std::vector<int32_t> a = {1, 3, 3, 2, 5, 9, 4, 3, 2};
    -
    188 std::vector<int32_t> b = {11, 3, 7, 8, 6};
    -
    189 std::sort(a.begin(), a.end()); ///< Sort vector a
    -
    190 std::sort(b.begin(), b.end()); ///< Sort vector b
    -
    191 std::vector<int32_t> result = get_union(a, b);
    -
    192 std::vector<int32_t> expected = {1, 2, 3, 4, 5, 6, 7, 8, 9, 11};
    -
    193 assert(result == expected); ///< Check if result is correct
    -
    194 print(result); ///< Should print 1 2 3 4 5 6 7 8 9 11
    -
    195 std::cout << "TEST PASSED!\n\n";
    -
    196}
    +

    < Sort vector a

    +

    < Sort vector b

    +

    < Check if result is correct

    +

    < Should print 1 2 3 4 5 6 7 8 9 11

    +
    166 {
    +
    167 std::cout << "TEST CASE 6\n";
    +
    168 std::cout << "Intialized a = {1, 3, 3, 2, 5, 9, 4, 7, 3, 2} ";
    +
    169 std::cout << "b = {11, 3, 7, 8, 6}\n";
    +
    170 std::cout << "Expected result: {3, 7}\n";
    +
    171 std::vector<int32_t> a = {1, 3, 3, 2, 5, 9, 4, 7, 3, 2};
    +
    172 std::vector<int32_t> b = {11, 3, 7, 8, 6};
    +
    173 std::sort(a.begin(), a.end()); ///< Sort vector a
    +
    174 std::sort(b.begin(), b.end()); ///< Sort vector b
    +
    175 std::vector<int32_t> result = get_intersection(a, b);
    +
    176 std::vector<int32_t> expected = {3, 7};
    +
    177 assert(result == expected); ///< Check if result is correct
    +
    178 print(result); ///< Should print 3 7
    +
    179 std::cout << "TEST PASSED!\n\n";
    +
    180}
    std::vector::begin
    T begin(T... args)
    std::vector::end
    T end(T... args)
    math::fibonacci_sum::result
    uint64_t result(uint64_t n)
    Definition: fibonacci_sum.cpp:76
    -
    operations_on_datastructures::get_union
    std::vector< int32_t > 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.
    Definition: union_of_two_arrays.cpp:48
    +
    operations_on_datastructures::get_intersection
    std::vector< int32_t > get_intersection(const std::vector< int32_t > &first, const std::vector< int32_t > &second)
    Gets the intersection of two sorted arrays, and returns them in a vector.
    Definition: intersection_of_two_arrays.cpp:49
    std::sort
    T sort(T... args)
    Here is the call graph for this function:
    diff --git a/d9/df4/namespacetests_aacafde185abd8670abee51157f273dc2_cgraph.map b/d9/df4/namespacetests_aacafde185abd8670abee51157f273dc2_cgraph.map index 0ed0d97a4..918b95f5a 100644 --- a/d9/df4/namespacetests_aacafde185abd8670abee51157f273dc2_cgraph.map +++ b/d9/df4/namespacetests_aacafde185abd8670abee51157f273dc2_cgraph.map @@ -2,7 +2,7 @@ - + diff --git a/d9/df4/namespacetests_aacafde185abd8670abee51157f273dc2_cgraph.md5 b/d9/df4/namespacetests_aacafde185abd8670abee51157f273dc2_cgraph.md5 index 561edac61..81913bdff 100644 --- a/d9/df4/namespacetests_aacafde185abd8670abee51157f273dc2_cgraph.md5 +++ b/d9/df4/namespacetests_aacafde185abd8670abee51157f273dc2_cgraph.md5 @@ -1 +1 @@ -6e6b00aff1290eb8440957a48e1b1d3a \ No newline at end of file +537e7f0f522f6a36655c06e60bd108fb \ No newline at end of file diff --git a/d9/df4/namespacetests_aacafde185abd8670abee51157f273dc2_cgraph.svg b/d9/df4/namespacetests_aacafde185abd8670abee51157f273dc2_cgraph.svg index ed0521333..8f8b055ec 100644 --- a/d9/df4/namespacetests_aacafde185abd8670abee51157f273dc2_cgraph.svg +++ b/d9/df4/namespacetests_aacafde185abd8670abee51157f273dc2_cgraph.svg @@ -51,10 +51,10 @@ Node4 - + operations_on_datastructures -::get_union +::get_intersection diff --git a/da/d6d/namespaceoperations__on__datastructures.html b/da/d6d/namespaceoperations__on__datastructures.html index 54cf69b23..7366af174 100644 --- a/da/d6d/namespaceoperations__on__datastructures.html +++ b/da/d6d/namespaceoperations__on__datastructures.html @@ -107,6 +107,9 @@ Functions std::vector< int32_t > shift_right (const std::vector< int32_t > &array, size_t shift)  Shifts the given vector to the right by the shift amount and returns a new vector with the result. The original vector is not mutated. More...
      +std::vector< int32_t > get_intersection (const std::vector< int32_t > &first, const std::vector< int32_t > &second) + Gets the intersection of two sorted arrays, and returns them in a vector. More...
    +  std::vector< int32_t > 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...
      @@ -119,13 +122,94 @@ Functions

    Operations on Data Structures

    for assert for IO Operations

    Operations on data structures

    +

    for std::sort for assert for IO operations

    +

    Operations on Data Structures

    For assert For IO operations For std::queue

    Operations on Data Structures

    for std::count for assert for tolower for string operations for IO Operations

    -

    Operations on data structures

    -

    for std::sort for assert for IO operations

    -

    Operations on Data Structures

    +

    Operations on data structures

    Function Documentation

    + +

    ◆ get_intersection()

    + +
    +
    + + + + + + + + + + + + + + + + + + +
    std::vector< int32_t > operations_on_datastructures::get_intersection (const std::vector< int32_t > & first,
    const std::vector< int32_t > & second 
    )
    +
    + +

    Gets the intersection of two sorted arrays, and returns them in a vector.

    +

    An algorithm is used that compares the elements of the two vectors, incrementing the index of the smaller of the two. If the elements are the same, the element is appended to the result array to be returned.

    Parameters
    + + + +
    firstA std::vector of sorted integer values
    secondA std::vector of sorted integer values
    +
    +
    +
    Returns
    A std::vector of the intersection of the two arrays, in ascending order
    +

    < Vector to hold the intersection

    +

    < Index for the first array

    +

    < Index for the second array

    +

    < Length of first array

    +

    < Length of second array

    +

    < Increment index of second array

    +

    < Increment index of second array

    +

    < Add the element if it is unique

    +

    < Increment index of first array

    +

    < Increment index of second array too

    +
    50 {
    +
    51 std::vector<int32_t> res; ///< Vector to hold the intersection
    +
    52 size_t f_index = 0; ///< Index for the first array
    +
    53 size_t s_index = 0; ///< Index for the second array
    +
    54 size_t f_length = first.size(); ///< Length of first array
    +
    55 size_t s_length = second.size(); ///< Length of second array
    +
    56
    +
    57 while (f_index < f_length && s_index < s_length) {
    +
    58 if (first[f_index] < second[s_index]) {
    +
    59 f_index++; ///< Increment index of second array
    +
    60 } else if (first[f_index] > second[s_index]) {
    +
    61 s_index++; ///< Increment index of second array
    +
    62 } else {
    +
    63 if ((res.size() == 0) || (first[f_index] != res.back())) {
    +
    64 res.push_back(
    +
    65 first[f_index]); ///< Add the element if it is unique
    +
    66 }
    +
    67 f_index++; ///< Increment index of first array
    +
    68 s_index++; ///< Increment index of second array too
    +
    69 }
    +
    70 }
    +
    71 return res;
    +
    72}
    +
    std::vector::back
    T back(T... args)
    +
    std::vector::push_back
    T push_back(T... args)
    +
    std::vector::size
    T size(T... args)
    + +
    +Here is the call graph for this function:
    +
    +
    +
    +
    + +
    +

    ◆ get_union()

    @@ -219,11 +303,7 @@ Functions
    86 }
    87 return res;
    88}
    -
    std::vector::back
    T back(T... args)
    std::next
    T next(T... args)
    -
    std::vector::push_back
    T push_back(T... args)
    -
    std::vector::size
    T size(T... args)
    -
    std::vector
    Here is the call graph for this function:
    @@ -263,6 +343,10 @@ Here is the call graph for this function:

    Print newline

    Print each value in the array

    Print newline

    +

    Print each value in the array

    +

    Print newline

    +

    Print each value in the array

    +

    Print newline

    30 {
    31 for (int32_t i : array) {
    32 std::cout << i << " "; /// Print each value in the array
    diff --git a/da/d6d/namespaceoperations__on__datastructures.js b/da/d6d/namespaceoperations__on__datastructures.js index a2bdbae1b..348fd89d5 100644 --- a/da/d6d/namespaceoperations__on__datastructures.js +++ b/da/d6d/namespaceoperations__on__datastructures.js @@ -18,6 +18,7 @@ var namespaceoperations__on__datastructures = [ "trie_operations", null, [ [ "Tnode", "d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html", "d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode" ] ] ], + [ "get_intersection", "da/d6d/namespaceoperations__on__datastructures.html#adaf9a06f0c236c2d95c97e441ea2d12e", null ], [ "get_union", "da/d6d/namespaceoperations__on__datastructures.html#a2b8ff06a84b041457873840bf82e2d74", null ], [ "print", "da/d6d/namespaceoperations__on__datastructures.html#a6109193567a5b7e36a27f2b4865fce20", null ], [ "shift_right", "da/d6d/namespaceoperations__on__datastructures.html#a1bfb8711f49e591eb168ccaa3df6fb86", null ] diff --git a/da/d6d/namespaceoperations__on__datastructures_adaf9a06f0c236c2d95c97e441ea2d12e_cgraph.map b/da/d6d/namespaceoperations__on__datastructures_adaf9a06f0c236c2d95c97e441ea2d12e_cgraph.map new file mode 100644 index 000000000..876b77b75 --- /dev/null +++ b/da/d6d/namespaceoperations__on__datastructures_adaf9a06f0c236c2d95c97e441ea2d12e_cgraph.map @@ -0,0 +1,6 @@ + + + + + + diff --git a/da/d6d/namespaceoperations__on__datastructures_adaf9a06f0c236c2d95c97e441ea2d12e_cgraph.md5 b/da/d6d/namespaceoperations__on__datastructures_adaf9a06f0c236c2d95c97e441ea2d12e_cgraph.md5 new file mode 100644 index 000000000..ec8e895c4 --- /dev/null +++ b/da/d6d/namespaceoperations__on__datastructures_adaf9a06f0c236c2d95c97e441ea2d12e_cgraph.md5 @@ -0,0 +1 @@ +51f472c36fb78d4588fd0728c554f742 \ No newline at end of file diff --git a/da/d6d/namespaceoperations__on__datastructures_adaf9a06f0c236c2d95c97e441ea2d12e_cgraph.svg b/da/d6d/namespaceoperations__on__datastructures_adaf9a06f0c236c2d95c97e441ea2d12e_cgraph.svg new file mode 100644 index 000000000..4d778f3be --- /dev/null +++ b/da/d6d/namespaceoperations__on__datastructures_adaf9a06f0c236c2d95c97e441ea2d12e_cgraph.svg @@ -0,0 +1,68 @@ + + + + + + +operations_on_datastructures::get_intersection + + + +Node1 + + +operations_on_datastructures +::get_intersection + + + + + +Node2 + + +std::vector::back + + + + + +Node1->Node2 + + + + + +Node3 + + +std::vector::push_back + + + + + +Node1->Node3 + + + + + +Node4 + + +std::vector::size + + + + + +Node1->Node4 + + + + + diff --git a/de/dc5/intersection__of__two__arrays_8cpp.html b/de/dc5/intersection__of__two__arrays_8cpp.html new file mode 100644 index 000000000..3f8b59c37 --- /dev/null +++ b/de/dc5/intersection__of__two__arrays_8cpp.html @@ -0,0 +1,250 @@ + + + + + + + +Algorithms_in_C++: operations_on_datastructures/intersection_of_two_arrays.cpp File Reference + + + + + + + + + + + + + + + +
    +
    + + + + + + +
    +
    Algorithms_in_C++ 1.0.0 +
    +
    Set of algorithms implemented in C++.
    +
    +
    + + + + + + + +
    +
    + +
    +
    +
    + +
    + +
    +
    + + +
    + +
    + +
    +
    +Namespaces | +Functions
    +
    intersection_of_two_arrays.cpp File Reference
    +
    +
    + +

    Implementation for the Intersection of two sorted Arrays algorithm. +More...

    +
    #include <algorithm>
    +#include <cassert>
    +#include <iostream>
    +#include <vector>
    +
    +Include dependency graph for intersection_of_two_arrays.cpp:
    +
    +
    +
    +
    +
    + + + + + + + +

    +Namespaces

    namespace  operations_on_datastructures
     for std::vector
     
    namespace  tests
     Testcases to check Union of Two Arrays.
     
    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

    +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_intersection (const std::vector< int32_t > &first, const std::vector< int32_t > &second)
     Gets the intersection of two sorted arrays, and returns them in a vector. More...
     
    void tests::test1 ()
     A Test to check an simple case. More...
     
    void tests::test2 ()
     A Test to check an empty vector. More...
     
    void tests::test3 ()
     A Test to check an invalid shift value. More...
     
    void tests::test4 ()
     A Test to check a very large input. More...
     
    void tests::test5 ()
     A Test to check a shift of zero. 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_intersection() function. More...
     
    int main ()
     main function More...
     
    +

    Detailed Description

    +

    Implementation for the Intersection of two sorted Arrays algorithm.

    +

    The intersection of two arrays is the collection of all the elements that are common in both the first and second arrays. This implementation uses ordered arrays, and an algorithm to correctly order them and return the result as a new array (vector).

    See also
    union_of_two_arrays.cpp
    +
    Author
    Alvin
    +

    Function Documentation

    + +

    ◆ main()

    + +
    +
    + + + + + + + + +
    int main (void )
    +
    + +

    main function

    +
    Returns
    0 on exit
    +
    200 {
    +
    201 test(); // run self-test implementations
    +
    202 return 0;
    +
    203}
    +
    test
    static void test()
    Function to test the correctness of get_intersection() function.
    Definition: intersection_of_two_arrays.cpp:187
    +
    +Here is the call graph for this function:
    +
    +
    +
    +
    + +
    +
    + +

    ◆ test()

    + +
    +
    + + + + + +
    + + + + + + + +
    static void test ()
    +     		+static
    +
    + +

    Function to test the correctness of get_intersection() function.

    +
    Returns
    void
    +
    187 {
    +
    188 tests::test1();
    +
    189 tests::test2();
    +
    190 tests::test3();
    +
    191 tests::test4();
    +
    192 tests::test5();
    +
    193 tests::test6();
    +
    194}
    +
    tests::test1
    void test1()
    A Test to check an simple case.
    Definition: array_right_rotation.cpp:76
    +
    tests::test4
    void test4()
    A Test to check a very large input.
    Definition: array_right_rotation.cpp:121
    +
    tests::test3
    void test3()
    A Test to check an invalid shift value.
    Definition: array_right_rotation.cpp:106
    +
    tests::test6
    void test6()
    A Test to check correct functionality with an array sorted using std::sort.
    Definition: intersection_of_two_arrays.cpp:166
    +
    tests::test2
    void test2()
    A Test to check an empty vector.
    Definition: array_right_rotation.cpp:91
    +
    tests::test5
    void test5()
    A Test to check a shift of zero.
    Definition: array_right_rotation.cpp:144
    +
    +Here is the call graph for this function:
    +
    +
    +
    +
    + +
    +
    +
    +
    + + + + diff --git a/de/dc5/intersection__of__two__arrays_8cpp.js b/de/dc5/intersection__of__two__arrays_8cpp.js new file mode 100644 index 000000000..583e62b64 --- /dev/null +++ b/de/dc5/intersection__of__two__arrays_8cpp.js @@ -0,0 +1,13 @@ +var intersection__of__two__arrays_8cpp = +[ + [ "get_intersection", "de/dc5/intersection__of__two__arrays_8cpp.html#adaf9a06f0c236c2d95c97e441ea2d12e", null ], + [ "main", "de/dc5/intersection__of__two__arrays_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ], + [ "print", "de/dc5/intersection__of__two__arrays_8cpp.html#a6109193567a5b7e36a27f2b4865fce20", null ], + [ "test", "de/dc5/intersection__of__two__arrays_8cpp.html#aa8dca7b867074164d5f45b0f3851269d", null ], + [ "test1", "de/dc5/intersection__of__two__arrays_8cpp.html#a167c24bd817469ae47358d12e034f2d5", null ], + [ "test2", "de/dc5/intersection__of__two__arrays_8cpp.html#abdd77344d4af8fd56d14a5cabbf2f669", null ], + [ "test3", "de/dc5/intersection__of__two__arrays_8cpp.html#aa515639572647508b94986489aab6d76", null ], + [ "test4", "de/dc5/intersection__of__two__arrays_8cpp.html#a2b9769e44683dcb67fe1083ad91e134d", null ], + [ "test5", "de/dc5/intersection__of__two__arrays_8cpp.html#af7b81d7a1534216af6a36a80135beb86", null ], + [ "test6", "de/dc5/intersection__of__two__arrays_8cpp.html#aacafde185abd8670abee51157f273dc2", null ] +]; \ No newline at end of file diff --git a/de/dc5/intersection__of__two__arrays_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/de/dc5/intersection__of__two__arrays_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map new file mode 100644 index 000000000..64dac6b3b --- /dev/null +++ b/de/dc5/intersection__of__two__arrays_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map @@ -0,0 +1,20 @@ + + + + + + + + + + + + + + + + + + + + diff --git a/de/dc5/intersection__of__two__arrays_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/de/dc5/intersection__of__two__arrays_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 new file mode 100644 index 000000000..30b656d85 --- /dev/null +++ b/de/dc5/intersection__of__two__arrays_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 @@ -0,0 +1 @@ +d8943a7f71d6edbdca306d1447065b02 \ No newline at end of file diff --git a/de/dc5/intersection__of__two__arrays_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/de/dc5/intersection__of__two__arrays_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg new file mode 100644 index 000000000..e23eafe7c --- /dev/null +++ b/de/dc5/intersection__of__two__arrays_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg @@ -0,0 +1,345 @@ + + + + + + +test + + + +Node1 + + +test + + + + + +Node2 + + +tests::test1 + + + + + +Node1->Node2 + + + + + +Node8 + + +tests::test2 + + + + + +Node1->Node8 + + + + + +Node9 + + +tests::test3 + + + + + +Node1->Node9 + + + + + +Node10 + + +tests::test4 + + + + + +Node1->Node10 + + + + + +Node12 + + +tests::test5 + + + + + +Node1->Node12 + + + + + +Node13 + + +tests::test6 + + + + + +Node1->Node13 + + + + + +Node3 + + +print + + + + + +Node2->Node3 + + + + + +Node6 + + +operations_on_datastructures +::shift_right + + + + + +Node2->Node6 + + + + + +Node4 + + +std::endl + + + + + +Node3->Node4 + + + + + +Node5 + + +is_prime + + + + + +Node3->Node5 + + + + + +Node7 + + +std::vector::size + + + + + +Node6->Node7 + + + + + +Node8->Node3 + + + + + +Node8->Node6 + + + + + +Node9->Node3 + + + + + +Node9->Node6 + + + + + +Node10->Node3 + + + + + +Node10->Node6 + + + + + +Node11 + + +std::vector::push_back + + + + + +Node10->Node11 + + + + + +Node12->Node3 + + + + + +Node12->Node6 + + + + + +Node13->Node3 + + + + + +Node14 + + +std::vector::begin + + + + + +Node13->Node14 + + + + + +Node15 + + +std::vector::end + + + + + +Node13->Node15 + + + + + +Node16 + + +operations_on_datastructures +::get_intersection + + + + + +Node13->Node16 + + + + + +Node18 + + +std::sort + + + + + +Node13->Node18 + + + + + +Node16->Node7 + + + + + +Node16->Node11 + + + + + +Node17 + + +std::vector::back + + + + + +Node16->Node17 + + + + + diff --git a/de/dc5/intersection__of__two__arrays_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/de/dc5/intersection__of__two__arrays_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map new file mode 100644 index 000000000..9664dce18 --- /dev/null +++ b/de/dc5/intersection__of__two__arrays_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map @@ -0,0 +1,21 @@ + + + + + + + + + + + + + + + + + + + + + diff --git a/de/dc5/intersection__of__two__arrays_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/de/dc5/intersection__of__two__arrays_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 new file mode 100644 index 000000000..9b325a8b3 --- /dev/null +++ b/de/dc5/intersection__of__two__arrays_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 @@ -0,0 +1 @@ +417cd509b94870731902e932bd065945 \ No newline at end of file diff --git a/de/dc5/intersection__of__two__arrays_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/de/dc5/intersection__of__two__arrays_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg new file mode 100644 index 000000000..aa9190774 --- /dev/null +++ b/de/dc5/intersection__of__two__arrays_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -0,0 +1,448 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +main + + + +Node1 + + +main + + + + + +Node2 + + +test + + + + + +Node1->Node2 + + + + + +Node3 + + +tests::test1 + + + + + +Node2->Node3 + + + + + +Node9 + + +tests::test2 + + + + + +Node2->Node9 + + + + + +Node10 + + +tests::test3 + + + + + +Node2->Node10 + + + + + +Node11 + + +tests::test4 + + + + + +Node2->Node11 + + + + + +Node13 + + +tests::test5 + + + + + +Node2->Node13 + + + + + +Node14 + + +tests::test6 + + + + + +Node2->Node14 + + + + + +Node4 + + +print + + + + + +Node3->Node4 + + + + + +Node7 + + +operations_on_datastructures +::shift_right + + + + + +Node3->Node7 + + + + + +Node5 + + +std::endl + + + + + +Node4->Node5 + + + + + +Node6 + + +is_prime + + + + + +Node4->Node6 + + + + + +Node8 + + +std::vector::size + + + + + +Node7->Node8 + + + + + +Node9->Node4 + + + + + +Node9->Node7 + + + + + +Node10->Node4 + + + + + +Node10->Node7 + + + + + +Node11->Node4 + + + + + +Node11->Node7 + + + + + +Node12 + + +std::vector::push_back + + + + + +Node11->Node12 + + + + + +Node13->Node4 + + + + + +Node13->Node7 + + + + + +Node14->Node4 + + + + + +Node15 + + +std::vector::begin + + + + + +Node14->Node15 + + + + + +Node16 + + +std::vector::end + + + + + +Node14->Node16 + + + + + +Node17 + + +operations_on_datastructures +::get_intersection + + + + + +Node14->Node17 + + + + + +Node19 + + +std::sort + + + + + +Node14->Node19 + + + + + +Node17->Node8 + + + + + +Node17->Node12 + + + + + +Node18 + + +std::vector::back + + + + + +Node17->Node18 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/de/dc5/intersection__of__two__arrays_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/de/dc5/intersection__of__two__arrays_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg new file mode 100644 index 000000000..81d7bced4 --- /dev/null +++ b/de/dc5/intersection__of__two__arrays_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg @@ -0,0 +1,360 @@ + + + + + + +main + + + +Node1 + + +main + + + + + +Node2 + + +test + + + + + +Node1->Node2 + + + + + +Node3 + + +tests::test1 + + + + + +Node2->Node3 + + + + + +Node9 + + +tests::test2 + + + + + +Node2->Node9 + + + + + +Node10 + + +tests::test3 + + + + + +Node2->Node10 + + + + + +Node11 + + +tests::test4 + + + + + +Node2->Node11 + + + + + +Node13 + + +tests::test5 + + + + + +Node2->Node13 + + + + + +Node14 + + +tests::test6 + + + + + +Node2->Node14 + + + + + +Node4 + + +print + + + + + +Node3->Node4 + + + + + +Node7 + + +operations_on_datastructures +::shift_right + + + + + +Node3->Node7 + + + + + +Node5 + + +std::endl + + + + + +Node4->Node5 + + + + + +Node6 + + +is_prime + + + + + +Node4->Node6 + + + + + +Node8 + + +std::vector::size + + + + + +Node7->Node8 + + + + + +Node9->Node4 + + + + + +Node9->Node7 + + + + + +Node10->Node4 + + + + + +Node10->Node7 + + + + + +Node11->Node4 + + + + + +Node11->Node7 + + + + + +Node12 + + +std::vector::push_back + + + + + +Node11->Node12 + + + + + +Node13->Node4 + + + + + +Node13->Node7 + + + + + +Node14->Node4 + + + + + +Node15 + + +std::vector::begin + + + + + +Node14->Node15 + + + + + +Node16 + + +std::vector::end + + + + + +Node14->Node16 + + + + + +Node17 + + +operations_on_datastructures +::get_intersection + + + + + +Node14->Node17 + + + + + +Node19 + + +std::sort + + + + + +Node14->Node19 + + + + + +Node17->Node8 + + + + + +Node17->Node12 + + + + + +Node18 + + +std::vector::back + + + + + +Node17->Node18 + + + + + diff --git a/dir_35422be6552f1b3672c1b6c4aba2da64.html b/dir_35422be6552f1b3672c1b6c4aba2da64.html index 2736151a0..9c4713fbf 100644 --- a/dir_35422be6552f1b3672c1b6c4aba2da64.html +++ b/dir_35422be6552f1b3672c1b6c4aba2da64.html @@ -102,6 +102,9 @@ Files file  inorder_successor_of_bst.cpp  An implementation for finding the Inorder successor of a binary search tree Inorder successor of a node is the next node in Inorder traversal of the Binary Tree. Inorder Successor is NULL for the last node in Inorder traversal.
      +file  intersection_of_two_arrays.cpp + Implementation for the Intersection of two sorted Arrays algorithm.
    +  file  reverse_binary_tree.cpp  Implementation for the Reversing a Binary Tree recursively algorithm.
      diff --git a/dir_35422be6552f1b3672c1b6c4aba2da64.js b/dir_35422be6552f1b3672c1b6c4aba2da64.js index 3b0e441a3..75ac8baaf 100644 --- a/dir_35422be6552f1b3672c1b6c4aba2da64.js +++ b/dir_35422be6552f1b3672c1b6c4aba2da64.js @@ -2,6 +2,7 @@ var dir_35422be6552f1b3672c1b6c4aba2da64 = [ [ "array_right_rotation.cpp", "d6/d57/array__right__rotation_8cpp.html", "d6/d57/array__right__rotation_8cpp" ], [ "inorder_successor_of_bst.cpp", "d4/d32/inorder__successor__of__bst_8cpp.html", "d4/d32/inorder__successor__of__bst_8cpp" ], + [ "intersection_of_two_arrays.cpp", "de/dc5/intersection__of__two__arrays_8cpp.html", "de/dc5/intersection__of__two__arrays_8cpp" ], [ "reverse_binary_tree.cpp", "d4/db6/reverse__binary__tree_8cpp.html", "d4/db6/reverse__binary__tree_8cpp" ], [ "trie_multiple_search.cpp", "d7/def/trie__multiple__search_8cpp.html", "d7/def/trie__multiple__search_8cpp" ], [ "union_of_two_arrays.cpp", "d8/d9c/union__of__two__arrays_8cpp.html", "d8/d9c/union__of__two__arrays_8cpp" ] diff --git a/files.html b/files.html index 057dc042e..10aea84c3 100644 --- a/files.html +++ b/files.html @@ -270,9 +270,10 @@ solve-a-rat-in-a-maze-c-java-pytho/"  ► operations_on_datastructures  array_right_rotation.cppImplementation for the Array right Rotation algorithm  inorder_successor_of_bst.cppAn implementation for finding the Inorder successor of a binary search tree Inorder successor of a node is the next node in Inorder traversal of the Binary Tree. Inorder Successor is NULL for the last node in Inorder traversal - reverse_binary_tree.cppImplementation for the Reversing a Binary Tree recursively algorithm - trie_multiple_search.cppTrie datastructure with search variants - union_of_two_arrays.cppImplementation for the Union of two sorted Arrays algorithm + intersection_of_two_arrays.cppImplementation for the Intersection of two sorted Arrays algorithm + reverse_binary_tree.cppImplementation for the Reversing a Binary Tree recursively algorithm + trie_multiple_search.cppTrie datastructure with search variants + union_of_two_arrays.cppImplementation for the Union of two sorted Arrays algorithm  ► others  buzz_number.cppA buzz number is a number that is either divisible by 7 or has last digit as 7  decimal_to_binary.cppFunction to convert decimal number to binary representation diff --git a/globals_func_i.html b/globals_func_i.html index 7ce39a9c8..eaac1ff58 100644 --- a/globals_func_i.html +++ b/globals_func_i.html @@ -104,8 +104,8 @@ $(document).ready(function(){initNavTree('globals_func_i.html',''); initResizabl
  • is_happy() : happy_number.cpp
  • is_prime() : check_prime.cpp
  • is_square() : ordinary_least_squares_regressor.cpp
    • -
  • isPrime() : modular_inverse_fermat_little_theorem.cpp
  • IsPrime() : primality_test.cpp
    • +
  • isPrime() : modular_inverse_fermat_little_theorem.cpp
  • it_ternary_search() : ternary_search.cpp
    • diff --git a/globals_func_m.html b/globals_func_m.html index 0474a489b..e825bfde5 100644 --- a/globals_func_m.html +++ b/globals_func_m.html @@ -93,7 +93,7 @@ $(document).ready(function(){initNavTree('globals_func_m.html',''); initResizabl  

    - m -