diff --git a/d6/d1a/dnf__sort_8cpp.html b/d6/d1a/dnf__sort_8cpp.html
index 181b9ffdb..1e436859b 100644
--- a/d6/d1a/dnf__sort_8cpp.html
+++ b/d6/d1a/dnf__sort_8cpp.html
@@ -113,7 +113,7 @@ Include dependency graph for dnf_sort.cpp:
Namespaces
namespace sorting Sorting algorithms.
for working with vectors
namespace dnf_sort Functions for the DNF sort implementation.
Namespaces
namespace sorting Sorting algorithms.
for working with vectors
namespace radix_sort Functions for Radix sort algorithm.
Algorithms_in_C++: sorting/binary_insertion_sort.cpp File Reference
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ Algorithms_in_C++ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+Namespaces |
+Functions
+ binary_insertion_sort.cpp File Reference
+
+
+
+Binary Insertion Sort Algorithm (Insertion Sort)
+More...
+#include <algorithm>
+#include <cassert>
+#include <iostream>
+#include <vector>
+
+Include dependency graph for binary_insertion_sort.cpp:
+
+
+
+
+
+
+Namespaces
namespace sorting for working with vectors
+
+Functions
template<class T > int64_t sorting::binary_search (std::vector< T > &arr, T val, int64_t low, int64_t high) Binary search function to find the most suitable pace for an element. More...
template<typename T > void sorting::insertionSort_binsrch (std::vector< T > &arr) Insertion sort function to sort the vector. More...
static void test () Self-test implementations. More...
int main () Main function. More...
+Detailed Description
+Binary Insertion Sort Algorithm (Insertion Sort)
+If the cost of comparisons exceeds the cost of swaps, as is the case for example with string keys stored by reference or with human interaction (such as choosing one of a pair displayed side-by-side), then using binary insertion sort may yield better performance. Binary insertion sort employs a binary search to determine the correct location to insert new elements, and therefore performs ⌈log2 n⌉ comparisons in the worst case. When each element in the array is searched for and inserted this is O(n log n). The algorithm as a whole still has a running time of O(n2) on average because of the series
+- of swaps required for each insertion. However it has several advantages such as
+
+
+- Easy to implement
+- For small set of data it is quite efficient
+- More efficient that other Quadratic complexity algorithms like Selection sort or bubble sort.
+- It is efficient to use it when the cost of comparison is high.
+- It's stable that is it does not change the relative order of elements with equal keys.
+- It can sort the array or list as it receives.
+
+Example execution steps:
+- Suppose initially we have
+\begin{bmatrix}40 &30 &20 &50 &10\end{bmatrix}
+
+
+- We start traversing from 40 till we reach 10 when we reach at 30 we find that it is not at it's correct place so we take 30 and place it at a correct position thus the array will become
+\begin{bmatrix}30 &40 &20 &50 &10\end{bmatrix}
+
+
+- In the next iteration we are at 20 we find that this is also misplaced so we place it at the correct sorted position thus the array in this iteration becomes
+\begin{bmatrix}20 &30 &40 &50 &10\end{bmatrix}
+
+
+- We do not do anything with 50 and move on to the next iteration and select 10 which is misplaced and place it at correct position. Thus, we have
+\begin{bmatrix}10 &20 &30 &40 &50\end{bmatrix}
+
+
+
+Function Documentation
+
+◆ main()
+
+
+
+
+
+ int main
+ (
+ void
+ )
+
+
+
+
+
+◆ test()
+
+
+
+
+
+
+
+
+ static void test
+ (
+ )
+
+
+
+
+static
+
+
+
+
+Self-test implementations.
+- Returns
- void
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+T begin(T... args)
+T end(T... args)
+T endl(T... args)
+T is_sorted(T... args)
+void insertionSort_binsrch(std::vector< T > &arr)Insertion sort function to sort the vector.Definition: binary_insertion_sort.cpp:84
+
+
+Here is the call graph for this function:
+
+
+
+
+
+
+
+
+
+
+
+
+
+ - Generated by
1.9.2
+
+
+
+
diff --git a/d8/dcc/binary__insertion__sort_8cpp.js b/d8/dcc/binary__insertion__sort_8cpp.js
new file mode 100644
index 000000000..8e94a4ea2
--- /dev/null
+++ b/d8/dcc/binary__insertion__sort_8cpp.js
@@ -0,0 +1,7 @@
+var binary__insertion__sort_8cpp =
+[
+ [ "binary_search", "d8/dcc/binary__insertion__sort_8cpp.html#a034d8b276518a902962e87d3158b64fd", null ],
+ [ "insertionSort_binsrch", "d8/dcc/binary__insertion__sort_8cpp.html#a5f4bc75cca6dd8294af2d0e328006c68", null ],
+ [ "main", "d8/dcc/binary__insertion__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ],
+ [ "test", "d8/dcc/binary__insertion__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d", null ]
+];
\ No newline at end of file
diff --git a/d8/dcc/binary__insertion__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/d8/dcc/binary__insertion__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
new file mode 100644
index 000000000..70e64dce8
--- /dev/null
+++ b/d8/dcc/binary__insertion__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
@@ -0,0 +1,10 @@
+
diff --git a/d8/dcc/binary__insertion__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/d8/dcc/binary__insertion__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
new file mode 100644
index 000000000..761fbc1e8
--- /dev/null
+++ b/d8/dcc/binary__insertion__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
@@ -0,0 +1 @@
+bb74daf01f8665606f7306f347caeff8
\ No newline at end of file
diff --git a/d8/dcc/binary__insertion__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d8/dcc/binary__insertion__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
new file mode 100644
index 000000000..10561d19e
--- /dev/null
+++ b/d8/dcc/binary__insertion__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
@@ -0,0 +1,134 @@
+
+
+
+
+
diff --git a/d8/dcc/binary__insertion__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d8/dcc/binary__insertion__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
new file mode 100644
index 000000000..5572dab10
--- /dev/null
+++ b/d8/dcc/binary__insertion__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
@@ -0,0 +1,11 @@
+
diff --git a/d8/dcc/binary__insertion__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d8/dcc/binary__insertion__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
new file mode 100644
index 000000000..4bb34b55a
--- /dev/null
+++ b/d8/dcc/binary__insertion__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
@@ -0,0 +1 @@
+168974a6596cdd00c7f55ef02ee7470d
\ No newline at end of file
diff --git a/d8/dcc/binary__insertion__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d8/dcc/binary__insertion__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
new file mode 100644
index 000000000..249e644de
--- /dev/null
+++ b/d8/dcc/binary__insertion__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
@@ -0,0 +1,149 @@
+
+
+
+
+
diff --git a/d9/dca/namespacesearch.html b/d9/dca/namespacesearch.html
index 89e80088a..1f854ecef 100644
--- a/d9/dca/namespacesearch.html
+++ b/d9/dca/namespacesearch.html
@@ -99,9 +99,9 @@ $(document).ready(function(){initNavTree('d9/dca/namespacesearch.html','../../')
Detailed Description
for std::vector
Search algorithms.
+for std::sort function for std::assert for IO operations
for assert for IO operations
Search algorithms
-for std::sort function for std::assert for IO operations
for assert for io operations, and std::pair
Algorithms for searching
for assert for IO operations
diff --git a/db/d3f/wave__sort_8cpp.html b/db/d3f/wave__sort_8cpp.html
index e1f337ac7..fb1c8319e 100644
--- a/db/d3f/wave__sort_8cpp.html
+++ b/db/d3f/wave__sort_8cpp.html
@@ -113,7 +113,7 @@ Include dependency graph for wave_sort.cpp:
Namespaces
namespace sorting Sorting algorithms.
for working with vectors
namespace wave_sort Functions for the Wave sort implementation.
Namespaces
namespace sorting Sorting algorithms.
for working with vectors
namespace strand Functions for Strand Sort algorithm.
Namespaces
namespace sorting Sorting algorithms.
for working with vectors
Namespaces
Namespaces
+
+
+
+
+
+
+
+
+
+
+
+|
+ Algorithms_in_C++ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
+
+
+
+
+
+
+
+
+
+
+
+Namespaces |
+Functions
+ binary_insertion_sort.cpp File Reference
+
+
+
+
+
+
+
+
+
+Binary Insertion Sort Algorithm (Insertion Sort) +More...
+#include <algorithm>+
#include <cassert>+
#include <iostream>+
#include <vector>+
+Include dependency graph for binary_insertion_sort.cpp:
+
+
+
+
++Namespaces | |
| namespace | sorting |
| for working with vectors | |
+Functions | |
| template<class T > | |
| int64_t | sorting::binary_search (std::vector< T > &arr, T val, int64_t low, int64_t high) |
| Binary search function to find the most suitable pace for an element. More... | |
| template<typename T > | |
| void | sorting::insertionSort_binsrch (std::vector< T > &arr) |
| Insertion sort function to sort the vector. More... | |
| static void | test () |
| Self-test implementations. More... | |
| int | main () |
| Main function. More... | |
Detailed Description
+Binary Insertion Sort Algorithm (Insertion Sort)
+If the cost of comparisons exceeds the cost of swaps, as is the case for example with string keys stored by reference or with human interaction (such as choosing one of a pair displayed side-by-side), then using binary insertion sort may yield better performance. Binary insertion sort employs a binary search to determine the correct location to insert new elements, and therefore performs ⌈log2 n⌉ comparisons in the worst case. When each element in the array is searched for and inserted this is O(n log n). The algorithm as a whole still has a running time of O(n2) on average because of the series
-
+
- of swaps required for each insertion. However it has several advantages such as +
-
+
- Easy to implement +
- For small set of data it is quite efficient +
- More efficient that other Quadratic complexity algorithms like Selection sort or bubble sort. +
- It is efficient to use it when the cost of comparison is high. +
- It's stable that is it does not change the relative order of elements with equal keys. +
- It can sort the array or list as it receives. +
Example execution steps:
-
+
- Suppose initially we have
+\begin{bmatrix}40 &30 &20 &50 &10\end{bmatrix} +
+
+ - We start traversing from 40 till we reach 10 when we reach at 30 we find that it is not at it's correct place so we take 30 and place it at a correct position thus the array will become
+\begin{bmatrix}30 &40 &20 &50 &10\end{bmatrix} +
+
+ - In the next iteration we are at 20 we find that this is also misplaced so we place it at the correct sorted position thus the array in this iteration becomes
+\begin{bmatrix}20 &30 &40 &50 &10\end{bmatrix} +
+
+ - We do not do anything with 50 and move on to the next iteration and select 10 which is misplaced and place it at correct position. Thus, we have
+\begin{bmatrix}10 &20 &30 &40 &50\end{bmatrix} +
+
+
Function Documentation
+ +◆ main()
+ +
+
+
+
+
+
+
+| int main | +( | +void | +) | ++ |
◆ test()
+ +
+
+
+
+
+
+
|
+ +static | +
+
+
+Self-test implementations.
+- Returns
- void
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
T begin(T... args)
T end(T... args)
T endl(T... args)
T is_sorted(T... args)
void insertionSort_binsrch(std::vector< T > &arr)
Insertion sort function to sort the vector.
Definition: binary_insertion_sort.cpp:84
+Here is the call graph for this function:
+
+
+
+
+
+-
+
+
- Generated by 1.9.2
+
for std::vector
Search algorithms.
+for std::sort function for std::assert for IO operations
for assert for IO operations
Search algorithms
-for std::sort function for std::assert for IO operations
for assert for io operations, and std::pair
Algorithms for searching
for assert for IO operations
diff --git a/db/d3f/wave__sort_8cpp.html b/db/d3f/wave__sort_8cpp.html index e1f337ac7..fb1c8319e 100644 --- a/db/d3f/wave__sort_8cpp.html +++ b/db/d3f/wave__sort_8cpp.html @@ -113,7 +113,7 @@ Include dependency graph for wave_sort.cpp: