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 5f06b556b..768008139 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
@@ -111,6 +111,7 @@ Ciphers
diff --git a/d6/d8d/namespacemorse.html b/d6/d8d/namespacemorse.html
new file mode 100644
index 000000000..3d01c4656
--- /dev/null
+++ b/d6/d8d/namespacemorse.html
@@ -0,0 +1,112 @@
+
+
+
+Algorithms_in_C++: morse Namespace Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Functions for Morse Code .
+More...
+
+
Functions for Morse Code .
+
+
static char get_idx_char(const uint8_t idx)
Get the character at a given index in the STRKEY.
Definition: hill_cipher.cpp:182
std::string encrypt(const std::string &text, const int &shift)
Definition: caesar_cipher.cpp:65
static void test()
Function to test above algorithm.
Definition: morse_code.cpp:245
static const std::string codec(const std::string &text, const matrix< int > &key)
Convenience function to perform block cipher operations. The operations are identical for both encryp...
Definition: hill_cipher.cpp:210
int main()
Main function.
Definition: n_queens_all_solution_optimised.cpp:109
int main()
Definition: n_queens.cpp:118
bool solveMaze(int currposrow, int currposcol, const std::array< std::array< int, size >, size > &maze, std::array< std::array< int, size >, size > soln)
Solve rat maze problem.
Definition: rat_maze.cpp:45
node * deleteNode(node *root, int key)
Definition: avltree.cpp:88
bool CanIMove(const std::array< std::array< int, n >, n > &board, int row, int col)
Definition: n_queens_all_solution_optimised.cpp:59
void test2(const std::string &text)
Self test 2 - using 8x8 randomly generated key.
Definition: hill_cipher.cpp:505
void decreaseKey(int i, int new_val)
Definition: binaryheap.cpp:76
Functions for Morse Code.
void levelOrder(node *root)
Definition: avltree.cpp:119
bool isPossible(const std::array< std::array< int, V >, V > &mat, int i, int j, int no, int n)
Definition: sudoku_solve.cpp:36
Algorithms for encryption and decryption.
void test()
Definition: xor_cipher.cpp:75
Functions for Caesar cipher algorithm.
int main()
Definition: xor_cipher.cpp:95
void NQueenSol(std::array< std::array< int, n >, n > board, int col)
Definition: n_queens_all_solution_optimised.cpp:89
static const char * STRKEY
Definition: hill_cipher.cpp:73
static matrix< int > generate_decryption_key(matrix< int > const &encrypt_key)
Generate decryption matrix from an encryption matrix key.
Definition: hill_cipher.cpp:371
int h(int key)
Definition: hash_search.cpp:45
char morse_to_char(const std::string &s)
Definition: morse_code.cpp:118
int main()
Main function.
Definition: morse_code.cpp:268
int * harr
pointer to array of elements in heap
Definition: binaryheap.cpp:11
static const std::string encrypt_text(const std::string &text, const matrix< int > &encrypt_key)
Encrypt a given text using a given key.
Definition: hill_cipher.cpp:445
void test1(const std::string &text)
Self test 1 - using 3x3 randomly generated key.
Definition: hill_cipher.cpp:470
static std::pair< matrix< int >, matrix< int > > generate_keys(size_t size, int limit1=0, int limit2=10)
Generate encryption and decryption key pair.
Definition: hill_cipher.cpp:424
int minimax(int depth, int node_index, bool is_max, const std::array< int, T > &scores, double height)
Definition: minimax.cpp:38
static const T2 rand_range(T1 a, T1 b)
Function to generate a random integer in a given interval.
Definition: hill_cipher.cpp:92
Functions for Eight Queens puzzle optimized.
static std::ostream & operator<<(std::ostream &out, matrix< T > const &v)
Definition: hill_cipher.cpp:54
bool solveSudoku(std::array< std::array< int, V >, V > &mat, int i, int j)
Definition: sudoku_solve.cpp:91
Definition: binary_search_tree.cpp:17
int extractMin()
Definition: binaryheap.cpp:85
int right(int i)
Definition: binaryheap.cpp:34
std::string char_to_morse(const char &c)
Definition: morse_code.cpp:33
bool solve(int x, int y, int mov, std::array< std::array< int, V >, V > &sol, const std::array< int, V > &xmov, std::array< int, V > &ymov)
Definition: knight_tour.cpp:50
diff --git a/d8/d76/morse__code_8cpp.html b/d8/d76/morse__code_8cpp.html
new file mode 100644
index 000000000..5f52d185a
--- /dev/null
+++ b/d8/d76/morse__code_8cpp.html
@@ -0,0 +1,567 @@
+
+
+
+
+
+
+
+
Algorithms_in_C++: ciphers/morse_code.cpp File Reference
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Implementation of Morse Code .
+More...
+
#include <cassert>#include <iostream>#include <string>#include <vector>
+
+
Implementation of Morse Code .
+
Author Deep Raval
+
Morse code is a method used in telecommunication to encode text characters as standardized sequences of two different signal durations, called dots and dashes or dits and dahs. Morse code is named after Samuel Morse, an inventor of the telegraph.
+
+
+
◆
+
+
+
+
+
+ std::string ciphers::morse::char_to_morse (
+ const char &
+ c )
+
+
+
+
Get the morse representation for given character.
Parameters
+
+
+
+
Returns morse representation string of character
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
Decrypt given morse coded text.
Parameters
+
+ text text to be decrypted
+
+
+
Returns new decrypted text
+
+
+
+
+
+
+
222 std::size_t pos_start = 0, pos_end = 0, delim_len = 1;
+
+
224 while ((pos_end = text.
find (
' ' , pos_start)) != std::string::npos) {
+
+
226 pos_start = pos_end + delim_len;
+
+
+
+
+
+
+
+
+
+
236 return decrypted_text;
+
+
+
+
+
+
+
+
◆
+
+
+
+
Encrypt given text using morse code.
Parameters
+
+ text text to be encrypted
+
+
+
Returns new encrypted text
+
+
+
+
+
206 for (
const char &c : text) {
+
+
+
209 return encrypted_text;
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ int main
+ (
+ void
+ )
+
+
+
+
+
Main function.
+
Returns 0 on exit
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ char ciphers::morse::morse_to_char
+ (
+ const std::string &
+ s )
+
+
+
+
Get character from the morse representation.
Parameters
+
+ s Morse representation
+
+
+
Returns corresponding character
+
+
+
+
+
122 }
else if (s ==
"-..." ) {
+
+
124 }
else if (s ==
"-.-." ) {
+
+
126 }
else if (s ==
"-.." ) {
+
+
128 }
else if (s ==
"." ) {
+
+
130 }
else if (s ==
"..-." ) {
+
+
132 }
else if (s ==
"--." ) {
+
+
134 }
else if (s ==
"...." ) {
+
+
136 }
else if (s ==
".." ) {
+
+
138 }
else if (s ==
".---" ) {
+
+
140 }
else if (s ==
"-.-" ) {
+
+
142 }
else if (s ==
".-.." ) {
+
+
144 }
else if (s ==
"--" ) {
+
+
146 }
else if (s ==
"-." ) {
+
+
148 }
else if (s ==
"---" ) {
+
+
150 }
else if (s ==
".--." ) {
+
+
152 }
else if (s ==
"--.-" ) {
+
+
154 }
else if (s ==
".-." ) {
+
+
156 }
else if (s ==
"..." ) {
+
+
158 }
else if (s ==
"-" ) {
+
+
160 }
else if (s ==
"..-" ) {
+
+
162 }
else if (s ==
"...-" ) {
+
+
164 }
else if (s ==
".--" ) {
+
+
166 }
else if (s ==
"-..-" ) {
+
+
168 }
else if (s ==
"-.--" ) {
+
+
170 }
else if (s ==
"--.." ) {
+
+
172 }
else if (s ==
".----" ) {
+
+
174 }
else if (s ==
"..---" ) {
+
+
176 }
else if (s ==
"...--" ) {
+
+
178 }
else if (s ==
"....-" ) {
+
+
180 }
else if (s ==
"....." ) {
+
+
182 }
else if (s ==
"-...." ) {
+
+
184 }
else if (s ==
"--..." ) {
+
+
186 }
else if (s ==
"---.." ) {
+
+
188 }
else if (s ==
"----." ) {
+
+
190 }
else if (s ==
"-----" ) {
+
+
+
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+
+
+
+ static void test
+ (
+ )
+
+
+
+
+static
+
+
+
+
+
Function to test above algorithm.
+
Returns void
+
+
+
+
+
+
250 assert(text1 == decrypted1);
+
+
+
+
+
+
+
+
258 assert(text2 == decrypted2);
+
+
+
+
+
+
+
+
+
+
+
+
static void test()
Function to test above algorithm.
Definition: morse_code.cpp:245
+
+
+
+
+
std::string encrypt(const std::string &text)
Definition: morse_code.cpp:202
+
+
char morse_to_char(const std::string &s)
Definition: morse_code.cpp:118
+
+
+
std::string decrypt(const std::string &text)
Definition: morse_code.cpp:216
+
+
+
std::string char_to_morse(const char &c)
Definition: morse_code.cpp:33
+
+
+
+
diff --git a/d8/d76/morse__code_8cpp.js b/d8/d76/morse__code_8cpp.js
new file mode 100644
index 000000000..ccf68cef6
--- /dev/null
+++ b/d8/d76/morse__code_8cpp.js
@@ -0,0 +1,9 @@
+var morse__code_8cpp =
+[
+ [ "char_to_morse", "d8/d76/morse__code_8cpp.html#ab31773fd11555d21f70d6914138d9535", null ],
+ [ "decrypt", "d8/d76/morse__code_8cpp.html#a15c66ec8cf4cef0a35c50cbab86965dc", null ],
+ [ "encrypt", "d8/d76/morse__code_8cpp.html#a0242e458904de8a242fcdaffe9e3ba1a", null ],
+ [ "main", "d8/d76/morse__code_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ],
+ [ "morse_to_char", "d8/d76/morse__code_8cpp.html#ac9f294b0dec08a4a11d477a32f9bd829", null ],
+ [ "test", "d8/d76/morse__code_8cpp.html#aa8dca7b867074164d5f45b0f3851269d", null ]
+];
\ No newline at end of file
diff --git a/d8/d76/morse__code_8cpp_a0242e458904de8a242fcdaffe9e3ba1a_cgraph.map b/d8/d76/morse__code_8cpp_a0242e458904de8a242fcdaffe9e3ba1a_cgraph.map
new file mode 100644
index 000000000..5f23f27ea
--- /dev/null
+++ b/d8/d76/morse__code_8cpp_a0242e458904de8a242fcdaffe9e3ba1a_cgraph.map
@@ -0,0 +1,6 @@
+
+
diff --git a/d8/d76/morse__code_8cpp_a0242e458904de8a242fcdaffe9e3ba1a_cgraph.md5 b/d8/d76/morse__code_8cpp_a0242e458904de8a242fcdaffe9e3ba1a_cgraph.md5
new file mode 100644
index 000000000..3584b2382
--- /dev/null
+++ b/d8/d76/morse__code_8cpp_a0242e458904de8a242fcdaffe9e3ba1a_cgraph.md5
@@ -0,0 +1 @@
+a505842f535baf8aa31ca826362c388b
\ No newline at end of file
diff --git a/d8/d76/morse__code_8cpp_a0242e458904de8a242fcdaffe9e3ba1a_cgraph.svg b/d8/d76/morse__code_8cpp_a0242e458904de8a242fcdaffe9e3ba1a_cgraph.svg
new file mode 100644
index 000000000..1ab7ce01e
--- /dev/null
+++ b/d8/d76/morse__code_8cpp_a0242e458904de8a242fcdaffe9e3ba1a_cgraph.svg
@@ -0,0 +1,74 @@
+
+
+
+
+
+
+ciphers::morse::encrypt
+
+Node1
+
+ciphers::morse::encrypt
+
+
+
+
+Node2
+
+ciphers::morse::char
+_to_morse
+
+
+
+
+Node1->Node2
+
+
+
+Node2->Node2
+
+
+
+Node3
+
+std::endl
+
+
+
+
+Node2->Node3
+
+
+
+Node4
+
+std::exit
+
+
+
+
+Node2->Node4
+
+
+
diff --git a/d8/d76/morse__code_8cpp_a15c66ec8cf4cef0a35c50cbab86965dc_cgraph.map b/d8/d76/morse__code_8cpp_a15c66ec8cf4cef0a35c50cbab86965dc_cgraph.map
new file mode 100644
index 000000000..6b3043152
--- /dev/null
+++ b/d8/d76/morse__code_8cpp_a15c66ec8cf4cef0a35c50cbab86965dc_cgraph.map
@@ -0,0 +1,9 @@
+
+
diff --git a/d8/d76/morse__code_8cpp_a15c66ec8cf4cef0a35c50cbab86965dc_cgraph.md5 b/d8/d76/morse__code_8cpp_a15c66ec8cf4cef0a35c50cbab86965dc_cgraph.md5
new file mode 100644
index 000000000..0cbd15e8a
--- /dev/null
+++ b/d8/d76/morse__code_8cpp_a15c66ec8cf4cef0a35c50cbab86965dc_cgraph.md5
@@ -0,0 +1 @@
+650048ccd8647c87ba19707a92e0796e
\ No newline at end of file
diff --git a/d8/d76/morse__code_8cpp_a15c66ec8cf4cef0a35c50cbab86965dc_cgraph.svg b/d8/d76/morse__code_8cpp_a15c66ec8cf4cef0a35c50cbab86965dc_cgraph.svg
new file mode 100644
index 000000000..01254c1a3
--- /dev/null
+++ b/d8/d76/morse__code_8cpp_a15c66ec8cf4cef0a35c50cbab86965dc_cgraph.svg
@@ -0,0 +1,119 @@
+
+
+
+
+
+
+ciphers::morse::decrypt
+
+Node1
+
+ciphers::morse::decrypt
+
+
+
+
+Node2
+
+std::string::find
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+ciphers::morse::morse
+_to_char
+
+
+
+
+Node1->Node3
+
+
+
+Node6
+
+std::vector::push_back
+
+
+
+
+Node1->Node6
+
+
+
+Node7
+
+std::string::substr
+
+
+
+
+Node1->Node7
+
+
+
+Node3->Node3
+
+
+
+Node4
+
+std::endl
+
+
+
+
+Node3->Node4
+
+
+
+Node5
+
+std::exit
+
+
+
+
+Node3->Node5
+
+
+
diff --git a/d8/d76/morse__code_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/d8/d76/morse__code_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
new file mode 100644
index 000000000..b5f5a2647
--- /dev/null
+++ b/d8/d76/morse__code_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
@@ -0,0 +1,4 @@
+
+
diff --git a/d8/d76/morse__code_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/d8/d76/morse__code_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
new file mode 100644
index 000000000..822ad0f9b
--- /dev/null
+++ b/d8/d76/morse__code_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
@@ -0,0 +1 @@
+64c90610e30b3ab35b411975a63245fd
\ No newline at end of file
diff --git a/d8/d76/morse__code_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d8/d76/morse__code_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
new file mode 100644
index 000000000..ce45ce65e
--- /dev/null
+++ b/d8/d76/morse__code_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
@@ -0,0 +1,37 @@
+
+
+
+
+
+
+test
+
+Node1
+
+test
+
+
+
+
+Node2
+
+std::endl
+
+
+
+
+Node1->Node2
+
+
+
diff --git a/d8/d76/morse__code_8cpp_ab31773fd11555d21f70d6914138d9535_cgraph.map b/d8/d76/morse__code_8cpp_ab31773fd11555d21f70d6914138d9535_cgraph.map
new file mode 100644
index 000000000..a79373ce3
--- /dev/null
+++ b/d8/d76/morse__code_8cpp_ab31773fd11555d21f70d6914138d9535_cgraph.map
@@ -0,0 +1,5 @@
+
+
diff --git a/d8/d76/morse__code_8cpp_ab31773fd11555d21f70d6914138d9535_cgraph.md5 b/d8/d76/morse__code_8cpp_ab31773fd11555d21f70d6914138d9535_cgraph.md5
new file mode 100644
index 000000000..92310a60e
--- /dev/null
+++ b/d8/d76/morse__code_8cpp_ab31773fd11555d21f70d6914138d9535_cgraph.md5
@@ -0,0 +1 @@
+4209264eae1ca7017280aa50d7e51be3
\ No newline at end of file
diff --git a/d8/d76/morse__code_8cpp_ab31773fd11555d21f70d6914138d9535_cgraph.svg b/d8/d76/morse__code_8cpp_ab31773fd11555d21f70d6914138d9535_cgraph.svg
new file mode 100644
index 000000000..1f94335c0
--- /dev/null
+++ b/d8/d76/morse__code_8cpp_ab31773fd11555d21f70d6914138d9535_cgraph.svg
@@ -0,0 +1,59 @@
+
+
+
+
+
+
+ciphers::morse::char_to_morse
+
+Node1
+
+ciphers::morse::char
+_to_morse
+
+
+
+
+Node1->Node1
+
+
+
+Node2
+
+std::endl
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+std::exit
+
+
+
+
+Node1->Node3
+
+
+
diff --git a/d8/d76/morse__code_8cpp_ac9f294b0dec08a4a11d477a32f9bd829_cgraph.map b/d8/d76/morse__code_8cpp_ac9f294b0dec08a4a11d477a32f9bd829_cgraph.map
new file mode 100644
index 000000000..d981a8cca
--- /dev/null
+++ b/d8/d76/morse__code_8cpp_ac9f294b0dec08a4a11d477a32f9bd829_cgraph.map
@@ -0,0 +1,5 @@
+
+
diff --git a/d8/d76/morse__code_8cpp_ac9f294b0dec08a4a11d477a32f9bd829_cgraph.md5 b/d8/d76/morse__code_8cpp_ac9f294b0dec08a4a11d477a32f9bd829_cgraph.md5
new file mode 100644
index 000000000..d4265a7a9
--- /dev/null
+++ b/d8/d76/morse__code_8cpp_ac9f294b0dec08a4a11d477a32f9bd829_cgraph.md5
@@ -0,0 +1 @@
+b4b68d3edf62890658b64a882f9ff2d8
\ No newline at end of file
diff --git a/d8/d76/morse__code_8cpp_ac9f294b0dec08a4a11d477a32f9bd829_cgraph.svg b/d8/d76/morse__code_8cpp_ac9f294b0dec08a4a11d477a32f9bd829_cgraph.svg
new file mode 100644
index 000000000..ed4318185
--- /dev/null
+++ b/d8/d76/morse__code_8cpp_ac9f294b0dec08a4a11d477a32f9bd829_cgraph.svg
@@ -0,0 +1,59 @@
+
+
+
+
+
+
+ciphers::morse::morse_to_char
+
+Node1
+
+ciphers::morse::morse
+_to_char
+
+
+
+
+Node1->Node1
+
+
+
+Node2
+
+std::endl
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+std::exit
+
+
+
+
+Node1->Node3
+
+
+
diff --git a/d8/d76/morse__code_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d8/d76/morse__code_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
new file mode 100644
index 000000000..601e3c48a
--- /dev/null
+++ b/d8/d76/morse__code_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
@@ -0,0 +1,5 @@
+
+
diff --git a/d8/d76/morse__code_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d8/d76/morse__code_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
new file mode 100644
index 000000000..ef306b572
--- /dev/null
+++ b/d8/d76/morse__code_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
@@ -0,0 +1 @@
+f945d3bba300836c3b91b66ad0907ac0
\ No newline at end of file
diff --git a/d8/d76/morse__code_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d8/d76/morse__code_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
new file mode 100644
index 000000000..d2133fbc8
--- /dev/null
+++ b/d8/d76/morse__code_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
@@ -0,0 +1,52 @@
+
+
+
+
+
+
+main
+
+Node1
+
+main
+
+
+
+
+Node2
+
+test
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+std::endl
+
+
+
+
+Node2->Node3
+
+
+
diff --git a/db/d93/morse__code_8cpp__incl.map b/db/d93/morse__code_8cpp__incl.map
new file mode 100644
index 000000000..c2a7f4ace
--- /dev/null
+++ b/db/d93/morse__code_8cpp__incl.map
@@ -0,0 +1,7 @@
+
+
diff --git a/db/d93/morse__code_8cpp__incl.md5 b/db/d93/morse__code_8cpp__incl.md5
new file mode 100644
index 000000000..10295e73f
--- /dev/null
+++ b/db/d93/morse__code_8cpp__incl.md5
@@ -0,0 +1 @@
+c576a29550c2cc7177117650fa45369e
\ No newline at end of file
diff --git a/db/d93/morse__code_8cpp__incl.svg b/db/d93/morse__code_8cpp__incl.svg
new file mode 100644
index 000000000..45f8d1e32
--- /dev/null
+++ b/db/d93/morse__code_8cpp__incl.svg
@@ -0,0 +1,82 @@
+
+
+
+
+
+
+ciphers/morse_code.cpp
+
+Node1
+
+ciphers/morse_code.cpp
+
+
+
+
+Node2
+
+cassert
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+iostream
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+string
+
+
+
+
+Node1->Node4
+
+
+
+Node5
+
+vector
+
+
+
+
+Node1->Node5
+
+
+
diff --git a/dir_4d6e05837bf820fb089a8a8cdf2f42b7.html b/dir_4d6e05837bf820fb089a8a8cdf2f42b7.html
index 76f22310e..3b6e91d98 100644
--- a/dir_4d6e05837bf820fb089a8a8cdf2f42b7.html
+++ b/dir_4d6e05837bf820fb089a8a8cdf2f42b7.html
@@ -109,6 +109,9 @@ Files
file hill_cipher.cpp Implementation of Hill cipher algorithm.
+
file morse_code.cpp
+
Implementation of Morse Code .
+
file vigenere_cipher.cpp Implementation of Vigenère cipher algorithm.
diff --git a/dir_4d6e05837bf820fb089a8a8cdf2f42b7.js b/dir_4d6e05837bf820fb089a8a8cdf2f42b7.js
index 1d50d00e2..045ffc7a6 100644
--- a/dir_4d6e05837bf820fb089a8a8cdf2f42b7.js
+++ b/dir_4d6e05837bf820fb089a8a8cdf2f42b7.js
@@ -2,6 +2,7 @@ var dir_4d6e05837bf820fb089a8a8cdf2f42b7 =
[
[ "caesar_cipher.cpp", "d6/d2c/caesar__cipher_8cpp.html", "d6/d2c/caesar__cipher_8cpp" ],
[ "hill_cipher.cpp", "d7/db9/hill__cipher_8cpp.html", "d7/db9/hill__cipher_8cpp" ],
+ [ "morse_code.cpp", "d8/d76/morse__code_8cpp.html", "d8/d76/morse__code_8cpp" ],
[ "vigenere_cipher.cpp", "dd/d12/vigenere__cipher_8cpp.html", "dd/d12/vigenere__cipher_8cpp" ],
[ "xor_cipher.cpp", "d3/d4c/xor__cipher_8cpp.html", "d3/d4c/xor__cipher_8cpp" ]
];
\ No newline at end of file
diff --git a/files.html b/files.html
index 7eef6064a..5815c1c12 100644
--- a/files.html
+++ b/files.html
@@ -109,8 +109,9 @@ solve-a-rat-in-a-maze-c-java-pytho/">Rat in a Maze algorithm
► ciphers caesar_cipher.cpp Implementation of Caesar cipher algorithm hill_cipher.cpp Implementation of Hill cipher algorithm
-
vigenere_cipher.cpp Implementation of Vigenère cipher algorithm
-
xor_cipher.cpp Implementation of XOR cipher algorithm
+
morse_code.cpp Implementation of Morse Code
+
vigenere_cipher.cpp Implementation of Vigenère cipher algorithm
+
xor_cipher.cpp Implementation of XOR cipher algorithm ► data_structures ► cll cll.h
diff --git a/globals_func_m.html b/globals_func_m.html
index a4760d2d2..c1f091556 100644
--- a/globals_func_m.html
+++ b/globals_func_m.html
@@ -98,30 +98,30 @@ $(document).ready(function(){initNavTree('globals_func_m.html',''); initResizabl
,
knight_tour.cpp
,
n_queens.cpp
,
sudoku_solve.cpp
-,
linkedlist_implentation_usingarray.cpp
-,
hamiltons_cycle.cpp
-,
least_common_multiple.cpp
+,
linked_list.cpp
+,
dijkstra.cpp
+,
large_factorial.cpp
+,
insertion_sort.cpp
,
merge_insertion_sort.cpp
+,
least_common_multiple.cpp
,
merge_sort.cpp
-,
miller_rabin.cpp
,
pancake_sort.cpp
+,
hamiltons_cycle.cpp
+,
miller_rabin.cpp
,
pigeonhole_sort.cpp
-,
hopcroft_karp.cpp
-,
modular_inverse_fermat_little_theorem.cpp
-,
quick_sort.cpp
,
rabin_karp.cpp
,
knuth_morris_pratt.cpp
,
horspool.cpp
,
brute_force_string_searching.cpp
-,
quick_sort_3.cpp
-,
number_of_positive_divisors.cpp
-,
shell_sort2.cpp
,
strand_sort.cpp
-,
queue_using_two_stacks.cpp
-,
is_graph_bipartite.cpp
+,
quick_sort.cpp
+,
modular_inverse_fermat_little_theorem.cpp
+,
quick_sort_3.cpp
+,
shell_sort2.cpp
+,
linkedlist_implentation_usingarray.cpp
+,
hopcroft_karp.cpp
+,
number_of_positive_divisors.cpp
,
power_for_huge_numbers.cpp
-,
prime_factorization.cpp
-,
insertion_sort.cpp
,
heap_sort.cpp
,
gnome_sort.cpp
,
comb_sort.cpp
@@ -177,15 +177,15 @@ $(document).ready(function(){initNavTree('globals_func_m.html',''); initResizabl
,
sqrt_double.cpp
,
sieve_of_eratosthenes.cpp
,
realtime_stats.cpp
-,
lowest_common_ancestor.cpp
-,
prime_numbers.cpp
,
primes_up_to_billion.cpp
+,
is_graph_bipartite.cpp
+,
prime_factorization.cpp
+,
prime_numbers.cpp
,
caesar_cipher.cpp
-,
skip_list.cpp
+,
queue_using_two_stacks.cpp
+,
lowest_common_ancestor.cpp
,
spirograph.cpp
-,
jumpgame.cpp
-,
trie_modern.cpp
-,
large_factorial.cpp
+,
skip_list.cpp
,
gcd_recursive_euclidean.cpp
,
gcd_of_n_numbers.cpp
,
gcd_iterative_euclidean.cpp
@@ -209,15 +209,15 @@ $(document).ready(function(){initNavTree('globals_func_m.html',''); initResizabl
,
adaline_learning.cpp
,
quadratic_probing_hash_table.cpp
,
linear_probing_hash_table.cpp
-,
chaining.cpp
,
double_hash_hash_table.cpp
+,
jumpgame.cpp
+,
chaining.cpp
,
n_queens_all_solution_optimised.cpp
,
hill_cipher.cpp
+,
trie_modern.cpp
,
trie_tree.cpp
+,
morse_code.cpp
,
0_1_knapsack.cpp
-,
vigenere_cipher.cpp
-,
cut_rod.cpp
-,
dijkstra.cpp
,
depth_first_search.cpp
,
connected_components.cpp
,
breadth_first_search.cpp
@@ -226,13 +226,14 @@ $(document).ready(function(){initNavTree('globals_func_m.html',''); initResizabl
,
word_break.cpp
,
shortest_common_supersequence.cpp
,
kadane2.cpp
+,
cut_rod.cpp
,
minimax.cpp
,
nqueen_print_all_solutions.cpp
+,
vigenere_cipher.cpp
,
xor_cipher.cpp
-,
avltree.cpp
,
rat_maze.cpp
+,
avltree.cpp
,
disjoint_set.cpp
-,
linked_list.cpp
mat_mul()
: qr_eigen_values.cpp
diff --git a/globals_func_t.html b/globals_func_t.html
index 002418d30..840a3781a 100644
--- a/globals_func_t.html
+++ b/globals_func_t.html
@@ -98,35 +98,37 @@ $(document).ready(function(){initNavTree('globals_func_t.html',''); initResizabl
test()
: rat_maze.cpp
-, vigenere_cipher.cpp
-, cut_rod.cpp
-, check_amicable_pair.cpp
-, double_factorial.cpp
-, shortest_common_supersequence.cpp
-, fibonacci.cpp
-, sum_of_digits.cpp
-, xor_cipher.cpp
-, word_break.cpp
-, smallest_circle.cpp
-, median_search.cpp
-, jarvis_algorithm.cpp
-, bogo_sort.cpp
-, gnome_sort.cpp
-, caesar_cipher.cpp
-, trie_tree.cpp
-, is_graph_bipartite.cpp
-, heap_sort.cpp
-, merge_insertion_sort.cpp
-, jumpgame.cpp
-, pancake_sort.cpp
-, strand_sort.cpp
+, morse_code.cpp
, 0_1_knapsack.cpp
-, neural_network.cpp
-, horspool.cpp
, armstrong_number.cpp
+, check_amicable_pair.cpp
+, cut_rod.cpp
+, double_factorial.cpp
+, fibonacci.cpp
+, vigenere_cipher.cpp
+, shortest_common_supersequence.cpp
+, sum_of_digits.cpp
+, smallest_circle.cpp
+, word_break.cpp
+, median_search.cpp
+, bogo_sort.cpp
+, caesar_cipher.cpp
+, xor_cipher.cpp
+, jarvis_algorithm.cpp
+, gnome_sort.cpp
+, heap_sort.cpp
+, is_graph_bipartite.cpp
+, merge_insertion_sort.cpp
+, pancake_sort.cpp
+, trie_tree.cpp
+, jumpgame.cpp
+, strand_sort.cpp
+, horspool.cpp
+, neural_network.cpp
test1()
-: kohonen_som_topology.cpp
+: adaline_learning.cpp
+, kohonen_som_topology.cpp
, kohonen_som_trace.cpp
, large_factorial.cpp
, sum_of_digits.cpp
@@ -137,7 +139,6 @@ $(document).ready(function(){initNavTree('globals_func_t.html',''); initResizabl
, qr_eigen_values.cpp
, hill_cipher.cpp
, hamiltons_cycle.cpp
-, adaline_learning.cpp
test2()
: hill_cipher.cpp
@@ -155,28 +156,28 @@ $(document).ready(function(){initNavTree('globals_func_t.html',''); initResizabl
, smallest_circle.cpp
test3()
-: adaline_learning.cpp
-, golden_search_extrema.cpp
-, hamiltons_cycle.cpp
+: hamiltons_cycle.cpp
+, brent_method_extrema.cpp
+, adaline_learning.cpp
, kohonen_som_topology.cpp
, kohonen_som_trace.cpp
-, brent_method_extrema.cpp
+, golden_search_extrema.cpp
, smallest_circle.cpp
test_1()
-: heavy_light_decomposition.cpp
-, pigeonhole_sort.cpp
+: pigeonhole_sort.cpp
+, heavy_light_decomposition.cpp
test_2()
-: pigeonhole_sort.cpp
-, heavy_light_decomposition.cpp
+: heavy_light_decomposition.cpp
+, pigeonhole_sort.cpp
test_2d_classes()
: kohonen_som_topology.cpp
test_3()
-: heavy_light_decomposition.cpp
-, pigeonhole_sort.cpp
+: pigeonhole_sort.cpp
+, heavy_light_decomposition.cpp
test_3d_classes()
: kohonen_som_trace.cpp
@@ -213,20 +214,20 @@ $(document).ready(function(){initNavTree('globals_func_t.html',''); initResizabl
: kohonen_som_trace.cpp
tests()
-: lowest_common_ancestor.cpp
-, number_of_positive_divisors.cpp
+: number_of_positive_divisors.cpp
, hopcroft_karp.cpp
-, check_factorial.cpp
-, least_common_multiple.cpp
, sieve_of_eratosthenes.cpp
-, complex_numbers.cpp
-, miller_rabin.cpp
-, dijkstra.cpp
+, least_common_multiple.cpp
+, lowest_common_ancestor.cpp
, double_factorial.cpp
+, dijkstra.cpp
+, complex_numbers.cpp
, comb_sort.cpp
-, connected_components.cpp
-, breadth_first_search.cpp
+, check_factorial.cpp
+, miller_rabin.cpp
, insertion_sort.cpp
+, breadth_first_search.cpp
+, connected_components.cpp
TH()
: tower_of_hanoi.cpp
diff --git a/globals_i.html b/globals_i.html
index 190ee4a2c..f77f10acf 100644
--- a/globals_i.html
+++ b/globals_i.html
@@ -123,14 +123,14 @@ $(document).ready(function(){initNavTree('globals_i.html',''); initResizable();
is_square()
: ordinary_least_squares_regressor.cpp
-
isPrime()
-: modular_inverse_fermat_little_theorem.cpp
+ isprime
+: prime_factorization.cpp
IsPrime()
: primality_test.cpp
-
isprime
-: prime_factorization.cpp
+ isPrime()
+: modular_inverse_fermat_little_theorem.cpp
it_ternary_search()
: ternary_search.cpp
diff --git a/globals_m.html b/globals_m.html
index 12545d70d..ec8fc40d5 100644
--- a/globals_m.html
+++ b/globals_m.html
@@ -98,41 +98,41 @@ $(document).ready(function(){initNavTree('globals_m.html',''); initResizable();
, knight_tour.cpp
, n_queens.cpp
, sudoku_solve.cpp
-, linkedlist_implentation_usingarray.cpp
-, hamiltons_cycle.cpp
-, least_common_multiple.cpp
-, merge_insertion_sort.cpp
-, merge_sort.cpp
-, miller_rabin.cpp
-, pancake_sort.cpp
-, pigeonhole_sort.cpp
-, hopcroft_karp.cpp
-, modular_inverse_fermat_little_theorem.cpp
-, quick_sort.cpp
-, quick_sort_3.cpp
-, number_of_positive_divisors.cpp
-, shell_sort2.cpp
-, strand_sort.cpp
-, queue_using_two_stacks.cpp
-, is_graph_bipartite.cpp
-, power_for_huge_numbers.cpp
-, brute_force_string_searching.cpp
-, horspool.cpp
-, prime_factorization.cpp
-, knuth_morris_pratt.cpp
-, rabin_karp.cpp
-, lowest_common_ancestor.cpp
-, prime_numbers.cpp
-, primes_up_to_billion.cpp
-, caesar_cipher.cpp
-, skip_list.cpp
-, spirograph.cpp
-, realtime_stats.cpp
-, sieve_of_eratosthenes.cpp
-, jumpgame.cpp
-, sqrt_double.cpp
-, string_fibonacci.cpp
+, linked_list.cpp
+, dijkstra.cpp
+, large_factorial.cpp
, insertion_sort.cpp
+, merge_insertion_sort.cpp
+, least_common_multiple.cpp
+, merge_sort.cpp
+, pancake_sort.cpp
+, hamiltons_cycle.cpp
+, miller_rabin.cpp
+, pigeonhole_sort.cpp
+, quick_sort.cpp
+, modular_inverse_fermat_little_theorem.cpp
+, quick_sort_3.cpp
+, shell_sort2.cpp
+, linkedlist_implentation_usingarray.cpp
+, hopcroft_karp.cpp
+, number_of_positive_divisors.cpp
+, strand_sort.cpp
+, brute_force_string_searching.cpp
+, power_for_huge_numbers.cpp
+, horspool.cpp
+, knuth_morris_pratt.cpp
+, is_graph_bipartite.cpp
+, prime_factorization.cpp
+, rabin_karp.cpp
+, prime_numbers.cpp
+, caesar_cipher.cpp
+, queue_using_two_stacks.cpp
+, lowest_common_ancestor.cpp
+, primes_up_to_billion.cpp
+, realtime_stats.cpp
+, spirograph.cpp
+, sieve_of_eratosthenes.cpp
+, sqrt_double.cpp
, heap_sort.cpp
, gnome_sort.cpp
, comb_sort.cpp
@@ -182,21 +182,21 @@ $(document).ready(function(){initNavTree('globals_m.html',''); initResizable();
, gaussian_elimination.cpp
, false_position.cpp
, brent_method_extrema.cpp
-, trie_modern.cpp
-, chaining.cpp
-, sum_of_digits.cpp
, bisection_method.cpp
-, double_hash_hash_table.cpp
+, skip_list.cpp
+, jumpgame.cpp
+, string_fibonacci.cpp
+, sum_of_digits.cpp
+, chaining.cpp
, n_queens_all_solution_optimised.cpp
, hill_cipher.cpp
-, trie_tree.cpp
+, trie_modern.cpp
+, double_hash_hash_table.cpp
, linear_probing_hash_table.cpp
+, trie_tree.cpp
, quadratic_probing_hash_table.cpp
-, 0_1_knapsack.cpp
, adaline_learning.cpp
-, kohonen_som_topology.cpp
-, vigenere_cipher.cpp
-, large_factorial.cpp
+, morse_code.cpp
, gcd_recursive_euclidean.cpp
, gcd_of_n_numbers.cpp
, gcd_iterative_euclidean.cpp
@@ -214,25 +214,26 @@ $(document).ready(function(){initNavTree('globals_m.html',''); initResizable();
, binary_exponent.cpp
, armstrong_number.cpp
, ordinary_least_squares_regressor.cpp
-, cut_rod.cpp
-, kohonen_som_trace.cpp
, neural_network.cpp
-, kadane2.cpp
+, 0_1_knapsack.cpp
+, kohonen_som_topology.cpp
+, kohonen_som_trace.cpp
+, cut_rod.cpp
, minimax.cpp
, nqueen_print_all_solutions.cpp
-, xor_cipher.cpp
+, vigenere_cipher.cpp
+, kadane2.cpp
, shortest_common_supersequence.cpp
+, xor_cipher.cpp
, word_break.cpp
-, avltree.cpp
, jarvis_algorithm.cpp
-, line_segment_intersection.cpp
, rat_maze.cpp
-, disjoint_set.cpp
-, dijkstra.cpp
+, avltree.cpp
, depth_first_search.cpp
-, breadth_first_search.cpp
, connected_components.cpp
-, linked_list.cpp
+, line_segment_intersection.cpp
+, breadth_first_search.cpp
+, disjoint_set.cpp
mat_mul()
: qr_eigen_values.cpp
diff --git a/globals_p.html b/globals_p.html
index e0bfe83cf..0fbc24bc2 100644
--- a/globals_p.html
+++ b/globals_p.html
@@ -130,12 +130,12 @@ $(document).ready(function(){initNavTree('globals_p.html',''); initResizable();
predict_OLS_regressor()
: ordinary_least_squares_regressor.cpp
-
PRIME
-: rabin_karp.cpp
-
prime
: primes_up_to_billion.cpp
+
PRIME
+: rabin_karp.cpp
+
prime_factorization()
: prime_factorization.cpp
diff --git a/globals_t.html b/globals_t.html
index 2ed8afd0a..b407fed2f 100644
--- a/globals_t.html
+++ b/globals_t.html
@@ -98,35 +98,37 @@ $(document).ready(function(){initNavTree('globals_t.html',''); initResizable();
test()
: rat_maze.cpp
-, vigenere_cipher.cpp
-, cut_rod.cpp
-, check_amicable_pair.cpp
-, double_factorial.cpp
-, shortest_common_supersequence.cpp
-, fibonacci.cpp
-, sum_of_digits.cpp
-, xor_cipher.cpp
-, word_break.cpp
-, smallest_circle.cpp
-, median_search.cpp
-, jarvis_algorithm.cpp
-, bogo_sort.cpp
-, gnome_sort.cpp
-, caesar_cipher.cpp
-, trie_tree.cpp
-, is_graph_bipartite.cpp
-, heap_sort.cpp
-, merge_insertion_sort.cpp
-, jumpgame.cpp
-, pancake_sort.cpp
-, strand_sort.cpp
+, morse_code.cpp
, 0_1_knapsack.cpp
-, neural_network.cpp
-, horspool.cpp
, armstrong_number.cpp
+, check_amicable_pair.cpp
+, cut_rod.cpp
+, double_factorial.cpp
+, fibonacci.cpp
+, vigenere_cipher.cpp
+, shortest_common_supersequence.cpp
+, sum_of_digits.cpp
+, smallest_circle.cpp
+, word_break.cpp
+, median_search.cpp
+, bogo_sort.cpp
+, caesar_cipher.cpp
+, xor_cipher.cpp
+, jarvis_algorithm.cpp
+, gnome_sort.cpp
+, heap_sort.cpp
+, is_graph_bipartite.cpp
+, merge_insertion_sort.cpp
+, pancake_sort.cpp
+, trie_tree.cpp
+, jumpgame.cpp
+, strand_sort.cpp
+, horspool.cpp
+, neural_network.cpp
test1()
-: kohonen_som_topology.cpp
+: adaline_learning.cpp
+, kohonen_som_topology.cpp
, kohonen_som_trace.cpp
, large_factorial.cpp
, sum_of_digits.cpp
@@ -137,7 +139,6 @@ $(document).ready(function(){initNavTree('globals_t.html',''); initResizable();
, qr_eigen_values.cpp
, hill_cipher.cpp
, hamiltons_cycle.cpp
-, adaline_learning.cpp
test2()
: hill_cipher.cpp
@@ -155,28 +156,28 @@ $(document).ready(function(){initNavTree('globals_t.html',''); initResizable();
, smallest_circle.cpp
test3()
-: golden_search_extrema.cpp
+: hamiltons_cycle.cpp
+, brent_method_extrema.cpp
, adaline_learning.cpp
-, hamiltons_cycle.cpp
, kohonen_som_topology.cpp
, kohonen_som_trace.cpp
-, brent_method_extrema.cpp
+, golden_search_extrema.cpp
, smallest_circle.cpp
test_1()
-: heavy_light_decomposition.cpp
-, pigeonhole_sort.cpp
+: pigeonhole_sort.cpp
+, heavy_light_decomposition.cpp
test_2()
-: pigeonhole_sort.cpp
-, heavy_light_decomposition.cpp
+: heavy_light_decomposition.cpp
+, pigeonhole_sort.cpp
test_2d_classes()
: kohonen_som_topology.cpp
test_3()
-: heavy_light_decomposition.cpp
-, pigeonhole_sort.cpp
+: pigeonhole_sort.cpp
+, heavy_light_decomposition.cpp
test_3d_classes()
: kohonen_som_trace.cpp
@@ -206,8 +207,8 @@ $(document).ready(function(){initNavTree('globals_t.html',''); initResizable();
: postfix_evaluation.cpp
test_int()
-: shell_sort2.cpp
-, quick_sort_3.cpp
+: quick_sort_3.cpp
+, shell_sort2.cpp
test_lamniscate()
: kohonen_som_trace.cpp
@@ -216,20 +217,20 @@ $(document).ready(function(){initNavTree('globals_t.html',''); initResizable();
: brute_force_string_searching.cpp
tests()
-: least_common_multiple.cpp
-, number_of_positive_divisors.cpp
-, miller_rabin.cpp
-, check_factorial.cpp
-, lowest_common_ancestor.cpp
-, sieve_of_eratosthenes.cpp
-, dijkstra.cpp
-, hopcroft_karp.cpp
+: dijkstra.cpp
, connected_components.cpp
-, complex_numbers.cpp
-, insertion_sort.cpp
-, breadth_first_search.cpp
+, hopcroft_karp.cpp
+, sieve_of_eratosthenes.cpp
+, least_common_multiple.cpp
, double_factorial.cpp
+, breadth_first_search.cpp
, comb_sort.cpp
+, insertion_sort.cpp
+, miller_rabin.cpp
+, lowest_common_ancestor.cpp
+, number_of_positive_divisors.cpp
+, check_factorial.cpp
+, complex_numbers.cpp
TH()
: tower_of_hanoi.cpp
diff --git a/namespaces.html b/namespaces.html
index c36a75e9a..8bb436328 100644
--- a/namespaces.html
+++ b/namespaces.html
@@ -118,32 +118,33 @@ $(document).ready(function(){initNavTree('namespaces.html',''); initResizable();
N machine_learning Machine learning algorithms N median_search Functions for Median search algorithm N merge_insertion Combined Intersion-Merge sorting algorithm N n_queens Functions for Eight Queens puzzle N n_queens_all_solutions Functions for Eight Queens puzzle with all solutions N n_queens_optimized Functions for Eight Queens puzzle optimized N neural_network Neural Network or Multilayer Perceptron N others Other algorithms N pancake_sort Functions for Pancake sort algorithm N postfix_expression Functions for Postfix Expression algorithm N qr_algorithm Functions to compute QR decomposition of any rectangular matrix N quadratic_probing An implementation of hash table using quadratic probing algorithm N range_queries Algorithms and Data Structures that support range queries and updates N rat_maze Functions for N morse Functions for Morse Code N n_queens Functions for Eight Queens puzzle N n_queens_all_solutions Functions for Eight Queens puzzle with all solutions N n_queens_optimized Functions for Eight Queens puzzle optimized N neural_network Neural Network or Multilayer Perceptron N others Other algorithms N pancake_sort Functions for Pancake sort algorithm N postfix_expression Functions for Postfix Expression algorithm N qr_algorithm Functions to compute QR decomposition of any rectangular matrix N quadratic_probing An implementation of hash table using quadratic probing algorithm N range_queries Algorithms and Data Structures that support range queries and updates N rat_maze Functions for Rat in a Maze algorithm N search Search algorithms N shortest_common_supersequence Shortest Common Super Sequence algorithm N sorting Sorting algorithms N sparse_table Range queries using sparse-tables N spirograph N statistics Statistical algorithms N std STL namespace N strand Functions for Strand Sort algorithm N string_search String search algorithms N strings Algorithms with strings N util_functions Various utility functions used in Neural network N vigenere Functions for vigenère cipher algorithm N word_break Functions for Word Break problem N XOR Functions for XOR cipher algorithm N search Search algorithms N shortest_common_supersequence Shortest Common Super Sequence algorithm N sorting Sorting algorithms N sparse_table Range queries using sparse-tables N spirograph N statistics Statistical algorithms N std STL namespace N strand Functions for Strand Sort algorithm N string_search String search algorithms N strings Algorithms with strings N util_functions Various utility functions used in Neural network N vigenere Functions for vigenère cipher algorithm N word_break Functions for Word Break problem N XOR Functions for XOR cipher algorithm 
1.8.20
+