diff --git a/d2/d21/gnome__sort_8cpp.html b/d2/d21/gnome__sort_8cpp.html index 9c9d1f980..c211f0cc0 100644 --- a/d2/d21/gnome__sort_8cpp.html +++ b/d2/d21/gnome__sort_8cpp.html @@ -195,7 +195,7 @@ Here is the call graph for this function:
87  std::cout << "Test 1 - as a C-array...";
88  const int size = 6;
89  std::array<int, size> arr = {-22, 100, 150, 35, -10, 99};
-
90  sorting::gnomeSort(arr.data(),
+
90  sorting::gnomeSort(arr.data(),
91  size); // pass array data as a C-style array pointer
92  assert(std::is_sorted(std::begin(arr), std::end(arr)));
93  std::cout << " Passed\n";
@@ -245,6 +245,7 @@ Here is the call graph for this function:
std::endl
T endl(T... args)
std::begin
T begin(T... args)
std::end
T end(T... args)
+
std::array::data
T data(T... args)
Here is the call graph for this function:
-
+
@@ -483,7 +483,7 @@ Here is the call graph for this function:
Here is the call graph for this function:
-
+
diff --git a/d4/d7a/shell__sort2_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map b/d4/d7a/shell__sort2_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map index ad36f7080..b319cafa4 100644 --- a/d4/d7a/shell__sort2_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map +++ b/d4/d7a/shell__sort2_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map @@ -4,11 +4,13 @@ - - - - - - - + + + + + + + + + diff --git a/d4/d7a/shell__sort2_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5 b/d4/d7a/shell__sort2_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5 index 2fc15e3ee..e536a3e50 100644 --- a/d4/d7a/shell__sort2_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5 +++ b/d4/d7a/shell__sort2_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5 @@ -1 +1 @@ -1f2a8076113251b03a1a2595c2297a2a \ No newline at end of file +8312a95b91a6a5b14cc37f18812a9f6b \ No newline at end of file diff --git a/d4/d7a/shell__sort2_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg b/d4/d7a/shell__sort2_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg index 3445e9a57..a2a17822d 100644 --- a/d4/d7a/shell__sort2_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg +++ b/d4/d7a/shell__sort2_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg @@ -78,156 +78,186 @@ - - -Node7 - + + +Node9 + show_data - - -Node1->Node7 + + +Node1->Node9 - - -Node8 - + + +Node10 + std::srand - - -Node1->Node8 + + +Node1->Node10 - - -Node9 - + + +Node11 + test_f - - -Node1->Node9 + + +Node1->Node11 - - -Node11 - + + +Node13 + test_int - - -Node1->Node11 + + +Node1->Node13 - - -Node12 - + + +Node14 + std::time - - -Node1->Node12 + + +Node1->Node14 Node6 - - -sorting::shell_sort + + +std::vector::data Node5->Node6 + + + + + +Node7 + + +sorting::shell_sort + + + + + +Node5->Node7 - + + +Node8 + + +std::vector::size + + + + -Node7->Node3 +Node5->Node8 + + + + + +Node9->Node3 - - -Node9->Node2 + + +Node11->Node2 - - -Node9->Node4 + + +Node11->Node4 - - -Node9->Node5 + + +Node11->Node5 - - -Node10 - + + +Node12 + std::qsort - - -Node9->Node10 + + +Node11->Node12 - - -Node11->Node2 + + +Node13->Node2 - - -Node11->Node4 + + +Node13->Node4 - - -Node11->Node5 + + +Node13->Node5 - - -Node11->Node10 + + +Node13->Node12 diff --git a/d4/d7a/shell__sort2_8cpp_a22ea0d1f7943ebb4371d31e44b465b6d_cgraph.map b/d4/d7a/shell__sort2_8cpp_a22ea0d1f7943ebb4371d31e44b465b6d_cgraph.map index 6f5368a0d..886effd75 100644 --- a/d4/d7a/shell__sort2_8cpp_a22ea0d1f7943ebb4371d31e44b465b6d_cgraph.map +++ b/d4/d7a/shell__sort2_8cpp_a22ea0d1f7943ebb4371d31e44b465b6d_cgraph.map @@ -4,5 +4,7 @@ - + + + diff --git a/d4/d7a/shell__sort2_8cpp_a22ea0d1f7943ebb4371d31e44b465b6d_cgraph.md5 b/d4/d7a/shell__sort2_8cpp_a22ea0d1f7943ebb4371d31e44b465b6d_cgraph.md5 index 74ee9c39e..f8ffc10d3 100644 --- a/d4/d7a/shell__sort2_8cpp_a22ea0d1f7943ebb4371d31e44b465b6d_cgraph.md5 +++ b/d4/d7a/shell__sort2_8cpp_a22ea0d1f7943ebb4371d31e44b465b6d_cgraph.md5 @@ -1 +1 @@ -d9ca52359e643cec3d97204c9cf01843 \ No newline at end of file +5e4dc0eca2b39cd9fae33587beaad301 \ No newline at end of file diff --git a/d4/d7a/shell__sort2_8cpp_a22ea0d1f7943ebb4371d31e44b465b6d_cgraph.svg b/d4/d7a/shell__sort2_8cpp_a22ea0d1f7943ebb4371d31e44b465b6d_cgraph.svg index 129a37ce6..baf6ffa16 100644 --- a/d4/d7a/shell__sort2_8cpp_a22ea0d1f7943ebb4371d31e44b465b6d_cgraph.svg +++ b/d4/d7a/shell__sort2_8cpp_a22ea0d1f7943ebb4371d31e44b465b6d_cgraph.svg @@ -4,17 +4,17 @@ - - + + test_f - + Node1 - -test_f + +test_f @@ -22,76 +22,106 @@ Node2 - -std::clock + +std::clock Node1->Node2 - - + + Node3 - -std::qsort + +std::qsort Node1->Node3 - - + + Node4 - -std::rand + +std::rand Node1->Node4 - - + + Node5 - -sorting::shell_sort + +sorting::shell_sort Node1->Node5 - - + + Node6 - - -sorting::shell_sort + + +std::vector::data Node5->Node6 - - + + + + + +Node7 + + +sorting::shell_sort + + + + + +Node5->Node7 + + + + + +Node8 + + +std::vector::size + + + + + +Node5->Node8 + + diff --git a/d4/d7a/shell__sort2_8cpp_a895b313cb2671e8f712040460325573e_cgraph.map b/d4/d7a/shell__sort2_8cpp_a895b313cb2671e8f712040460325573e_cgraph.map index c7e77f18f..c0618e22a 100644 --- a/d4/d7a/shell__sort2_8cpp_a895b313cb2671e8f712040460325573e_cgraph.map +++ b/d4/d7a/shell__sort2_8cpp_a895b313cb2671e8f712040460325573e_cgraph.map @@ -4,5 +4,7 @@ - + + + diff --git a/d4/d7a/shell__sort2_8cpp_a895b313cb2671e8f712040460325573e_cgraph.md5 b/d4/d7a/shell__sort2_8cpp_a895b313cb2671e8f712040460325573e_cgraph.md5 index 2424eb5a8..f63b00fa4 100644 --- a/d4/d7a/shell__sort2_8cpp_a895b313cb2671e8f712040460325573e_cgraph.md5 +++ b/d4/d7a/shell__sort2_8cpp_a895b313cb2671e8f712040460325573e_cgraph.md5 @@ -1 +1 @@ -9ef6c49ef396e2aecd18782d8e9a1d20 \ No newline at end of file +1c3d9451382ccdeb163a46dcbfa5def2 \ No newline at end of file diff --git a/d4/d7a/shell__sort2_8cpp_a895b313cb2671e8f712040460325573e_cgraph.svg b/d4/d7a/shell__sort2_8cpp_a895b313cb2671e8f712040460325573e_cgraph.svg index 1999455e2..f5a114dad 100644 --- a/d4/d7a/shell__sort2_8cpp_a895b313cb2671e8f712040460325573e_cgraph.svg +++ b/d4/d7a/shell__sort2_8cpp_a895b313cb2671e8f712040460325573e_cgraph.svg @@ -4,17 +4,17 @@ - - + + test_int - + Node1 - -test_int + +test_int @@ -22,76 +22,106 @@ Node2 - -std::clock + +std::clock Node1->Node2 - - + + Node3 - -std::qsort + +std::qsort Node1->Node3 - - + + Node4 - -std::rand + +std::rand Node1->Node4 - - + + Node5 - -sorting::shell_sort + +sorting::shell_sort Node1->Node5 - - + + Node6 - - -sorting::shell_sort + + +std::vector::data Node5->Node6 - - + + + + + +Node7 + + +sorting::shell_sort + + + + + +Node5->Node7 + + + + + +Node8 + + +std::vector::size + + + + + +Node5->Node8 + + diff --git a/d5/d91/namespacesorting.html b/d5/d91/namespacesorting.html index 34b8924bb..efffe1ed3 100644 --- a/d5/d91/namespacesorting.html +++ b/d5/d91/namespacesorting.html @@ -302,7 +302,7 @@ template<typename T >
77  {
-
78  size_t n = arr->size();
+
78  size_t n = arr->size();
79 
80  for (size_t i = 1; i < n; i++) {
81  T temp = arr[0][i];
@@ -314,7 +314,13 @@ template<typename T >
87  arr[0][j + 1] = temp;
88  }
89 }
- +
+Here is the call graph for this function:
+
+
+
+
+ @@ -948,15 +954,15 @@ template<typename T , size_t N>
Returns
new array with elements sorted from a given array
51  {
52  // Untill array is not sorted
-
53  while (!std::is_sorted(arr.begin(), arr.end())) {
-
54  std::random_shuffle(arr.begin(), arr.end());// Shuffle the array
+
53  while (!std::is_sorted(arr.begin(), arr.end())) {
+
54  std::random_shuffle(arr.begin(), arr.end());// Shuffle the array
55  }
56  return arr;
57 }
Here is the call graph for this function:
-
+
@@ -981,12 +987,12 @@ template<typename T >

function overload - when input array is of type std::vector, simply send the data content and the data length to the above function.

75  {
-
76  shell_sort(arr->data(), arr->size());
+
76  shell_sort(arr->data(), arr->size());
77 }
Here is the call graph for this function:
-
+
@@ -1123,6 +1129,7 @@ Here is the call graph for this function:
std::max_element
T max_element(T... args)
sorting::quicksort
std::vector< T > quicksort(std::vector< T > arr, int32_t low, int32_t high)
Definition: quick_sort_3.cpp:119
std::move
T move(T... args)
+
std::vector::size
T size(T... args)
sorting::partition
int partition(int arr[], int low, int high)
Definition: quick_sort.cpp:37
std::is_sorted
T is_sorted(T... args)
merge
void merge(int *arr, int l, int m, int r)
Definition: merge_sort.cpp:33
@@ -1137,6 +1144,7 @@ Here is the call graph for this function:
std::max
T max(T... args)
std::random_shuffle
T random_shuffle(T... args)
sorting::quickSort
void quickSort(int arr[], int low, int high)
Definition: quick_sort.cpp:63
+
std::vector::data
T data(T... args)
sorting::shell_sort
void shell_sort(std::vector< T > *arr)
Definition: shell_sort2.cpp:75
Here is the call graph for this function:
-
+
@@ -259,7 +259,7 @@ template<typename T , size_t N>
Here is the call graph for this function:
-
+
diff --git a/d5/ddb/bogo__sort_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.map b/d5/ddb/bogo__sort_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.map index 1cc9a5956..cad09d35a 100644 --- a/d5/ddb/bogo__sort_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.map +++ b/d5/ddb/bogo__sort_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.map @@ -1,8 +1,10 @@ - - - - - - + + + + + + + + diff --git a/d5/ddb/bogo__sort_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.md5 b/d5/ddb/bogo__sort_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.md5 index 7261cf2db..459f6f066 100644 --- a/d5/ddb/bogo__sort_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.md5 +++ b/d5/ddb/bogo__sort_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.md5 @@ -1 +1 @@ -0ded85ab58a238c1e5d03edeff32762d \ No newline at end of file +077bde9b0f020f893f1a288aaa64fae7 \ No newline at end of file diff --git a/d5/ddb/bogo__sort_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.svg b/d5/ddb/bogo__sort_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.svg index 0ebe1105d..700e1db23 100644 --- a/d5/ddb/bogo__sort_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.svg +++ b/d5/ddb/bogo__sort_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.svg @@ -4,11 +4,11 @@ - - + + test - + Node1 @@ -22,16 +22,16 @@ Node2 - -std::is_sorted + +std::is_sorted Node1->Node2 - - + + @@ -64,41 +64,71 @@ - - -Node6 - + + +Node8 + show_array - - -Node1->Node6 + + +Node1->Node8 - + Node4->Node2 - - + + Node5 - - -std::random_shuffle + + +std::array::begin - + Node4->Node5 - - + + + + + +Node6 + + +std::array::end + + + + + +Node4->Node6 + + + + + +Node7 + + +std::random_shuffle + + + + + +Node4->Node7 + + diff --git a/d5/ddb/bogo__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d5/ddb/bogo__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map index f4e826f54..51a4b8575 100644 --- a/d5/ddb/bogo__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map +++ b/d5/ddb/bogo__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map @@ -1,9 +1,11 @@ - - - - - - - + + + + + + + + + diff --git a/d5/ddb/bogo__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d5/ddb/bogo__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 index 1361fc8f5..fd94e4fdd 100644 --- a/d5/ddb/bogo__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 +++ b/d5/ddb/bogo__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 @@ -1 +1 @@ -9b7c9eb20aba414320ca9a4fe8e3e6ca \ No newline at end of file +268e5fc1f957f24a22aa0fabfbe106d5 \ No newline at end of file diff --git a/d5/ddb/bogo__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d5/ddb/bogo__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg index e3ad09a99..2e80629da 100644 --- a/d5/ddb/bogo__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg +++ b/d5/ddb/bogo__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -4,11 +4,11 @@ - - + + main - + Node1 @@ -34,96 +34,126 @@ - - -Node5 - + + +Node7 + show_array - - -Node1->Node5 + + +Node1->Node7 - - -Node6 - + + +Node8 + test - - -Node1->Node6 + + +Node1->Node8 Node3 - - -std::is_sorted + + +std::array::begin Node2->Node3 - - + + Node4 - - -std::random_shuffle + + +std::array::end Node2->Node4 - - + + - - -Node6->Node2 + + +Node5 + + +std::is_sorted + + + + + +Node2->Node5 + + + + + +Node6 + + +std::random_shuffle + + + + + +Node2->Node6 + + + + + +Node8->Node2 - - -Node6->Node3 - - + + +Node8->Node5 + + - - -Node6->Node5 + + +Node8->Node7 - - -Node7 - + + +Node9 + std::rand - - -Node6->Node7 + + +Node8->Node9 diff --git a/dd/d91/class_fenwick_tree.html b/dd/d91/class_fenwick_tree.html index 4246b05e6..65bdbdc93 100644 --- a/dd/d91/class_fenwick_tree.html +++ b/dd/d91/class_fenwick_tree.html @@ -166,7 +166,7 @@ int n
28  {
-
29  n = arr.size();
+
29  n = arr.size();
30  bit.assign(n + 1, 0);
31  for (int i = 0; i < n; ++i) {
32  update(i, arr[i]);
@@ -175,7 +175,7 @@ int n
Here is the call graph for this function:
-
+
@@ -393,6 +393,7 @@ Here is the call graph for this function:
+
std::vector::size
T size(T... args)
FenwickTree::offset
int offset(int x)
Definition: fenwick_tree.cpp:22
FenwickTree::update
void update(int id, int val)
Definition: fenwick_tree.cpp:45
std::vector::assign
T assign(T... args)
diff --git a/dd/d91/class_fenwick_tree_aaddab1f03d4941212a82cc647b1adb17_cgraph.map b/dd/d91/class_fenwick_tree_aaddab1f03d4941212a82cc647b1adb17_cgraph.map index b08380a39..a371b5b46 100644 --- a/dd/d91/class_fenwick_tree_aaddab1f03d4941212a82cc647b1adb17_cgraph.map +++ b/dd/d91/class_fenwick_tree_aaddab1f03d4941212a82cc647b1adb17_cgraph.map @@ -1,6 +1,7 @@ - + - - + + + diff --git a/dd/d91/class_fenwick_tree_aaddab1f03d4941212a82cc647b1adb17_cgraph.md5 b/dd/d91/class_fenwick_tree_aaddab1f03d4941212a82cc647b1adb17_cgraph.md5 index 558d6c1c8..933dbd32e 100644 --- a/dd/d91/class_fenwick_tree_aaddab1f03d4941212a82cc647b1adb17_cgraph.md5 +++ b/dd/d91/class_fenwick_tree_aaddab1f03d4941212a82cc647b1adb17_cgraph.md5 @@ -1 +1 @@ -efd3bbb36dd2cfc26c4d04069044b936 \ No newline at end of file +766ae16bbe4197ee1aec4209cd187ebf \ No newline at end of file diff --git a/dd/d91/class_fenwick_tree_aaddab1f03d4941212a82cc647b1adb17_cgraph.svg b/dd/d91/class_fenwick_tree_aaddab1f03d4941212a82cc647b1adb17_cgraph.svg index 31ec05f7f..b7db5974b 100644 --- a/dd/d91/class_fenwick_tree_aaddab1f03d4941212a82cc647b1adb17_cgraph.svg +++ b/dd/d91/class_fenwick_tree_aaddab1f03d4941212a82cc647b1adb17_cgraph.svg @@ -4,17 +4,17 @@ - - + + FenwickTree::FenwickTree - + Node1 - -FenwickTree::FenwickTree + +FenwickTree::FenwickTree @@ -22,44 +22,59 @@ Node2 - -std::vector::assign + +std::vector::assign Node1->Node2 - - + + Node3 - - -FenwickTree::update + + +std::vector::size Node1->Node3 - - + + Node4 - + + +FenwickTree::update + + + + + +Node1->Node4 + + + + + +Node5 + FenwickTree::offset - - -Node3->Node4 + + +Node4->Node5 diff --git a/de/d0d/fibonacci__search_8cpp.html b/de/d0d/fibonacci__search_8cpp.html index 7189c407d..1af56334e 100644 --- a/de/d0d/fibonacci__search_8cpp.html +++ b/de/d0d/fibonacci__search_8cpp.html @@ -169,7 +169,7 @@ bool 
23  {
24  // initialize last and current members of Fibonacci sequence
25  int last = 0, current = 1;
-
26  int length = arr.size(); // array size
+
26  int length = arr.size(); // array size
27  // next member of Fibonacci sequence which is "last" + "current"
28  int next = last + current;
29 
@@ -205,7 +205,7 @@ bool  59  }
60  }
61  // comparing the last element
-
62  if(current && !arr.empty() && arr[offset+1] == value){
+
62  if(current && !arr.empty() && arr[offset+1] == value){
63  return offset+1;
64  }
65  // value was not found, return -1
@@ -214,7 +214,7 @@ bool  Here is the call graph for this function:
-
+
@@ -244,7 +244,7 @@ Here is the call graph for this function:
Here is the call graph for this function:
-
+
@@ -253,8 +253,10 @@ Here is the call graph for this function:
random_tests
bool random_tests()
random tests which cover cases when we have one, multiple or zero occurences of the value we're looki...
Definition: fibonacci_search.cpp:96
+
std::vector::size
T size(T... args)
std::min
T min(T... args)
no_occurence_tests
bool no_occurence_tests()
random tests for checking performance when an array doesn't contain an element
Definition: fibonacci_search.cpp:72
+
std::vector::empty
T empty(T... args)
std::next
T next(T... args)