Update Notes.md

Author: Blooverh

PythonDataStructsAndAlgo/Notes.md

@@ -142,4 +142,6 @@
     Output: The array A with elements rearranged in nondecreasing order (ascending order)
 
     for k from 1 to n-1 do
-        Insert A[k] at its proper location within A[0], A[1],..., A[k]
+        Insert A[k] at its proper location within A[0], A[1],..., A[k]
+
+### Simple cryptography