hxx/javascript-algorithms
1
0
Fork 0
mirror of https://github.moeyy.xyz/https://github.com/trekhleb/javascript-algorithms.git synced 2024-12-27 15:41:16 +08:00
Code Issues Packages Projects Releases Wiki Activity

README fixes.

Browse Source
This commit is contained in:
Oleksii Trekhleb 2022-01-22 10:50:33 +01:00
parent 80d2f508d3
commit 7d13e6863a
3 changed files with 5 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

3
src/algorithms/cryptography/caesar-cipher/README.md
View File

@ -1,5 +1,8 @@
# Caesar Cipher Algorithm # Caesar Cipher Algorithm
_Read this in other languages:_
[_Русский_](README.ru-RU.md)
In cryptography, a **Caesar cipher**, also known as **Caesar's cipher**, the **shift cipher**, **Caesar's code** or **Caesar shift**, is one of the simplest and most widely known encryption techniques. It is a type of substitution cipher in which each letter in the plaintext is replaced by a letter some fixed number of positions down the alphabet. For example, with a left shift of `3`, `D` would be replaced by `A`, `E` would become `B`, and so on. The method is named after Julius Caesar, who used it in his private correspondence. In cryptography, a **Caesar cipher**, also known as **Caesar's cipher**, the **shift cipher**, **Caesar's code** or **Caesar shift**, is one of the simplest and most widely known encryption techniques. It is a type of substitution cipher in which each letter in the plaintext is replaced by a letter some fixed number of positions down the alphabet. For example, with a left shift of `3`, `D` would be replaced by `A`, `E` would become `B`, and so on. The method is named after Julius Caesar, who used it in his private correspondence.
![Caesar Cipher Algorithm](https://upload.wikimedia.org/wikipedia/commons/4/4a/Caesar_cipher_left_shift_of_3.svg) ![Caesar Cipher Algorithm](https://upload.wikimedia.org/wikipedia/commons/4/4a/Caesar_cipher_left_shift_of_3.svg)

2
src/algorithms/linked-list/traversal/README.md
View File

@ -1,7 +1,7 @@
# Linked List Traversal # Linked List Traversal
_Read this in other languages:_ _Read this in other languages:_
[_Русский_](README.ru-RU.md) [_Русский_](README.ru-RU.md),
[中文](README.zh-CN.md) [中文](README.zh-CN.md)
The task is to traverse the given linked list in straight order. The task is to traverse the given linked list in straight order.

2
src/algorithms/string/knuth-morris-pratt/knuthMorrisPratt.js
View File

@ -43,7 +43,7 @@ export default function knuthMorrisPratt(text, word) {
if (text[textIndex] === word[wordIndex]) { if (text[textIndex] === word[wordIndex]) {
// We've found a match. // We've found a match.
if (wordIndex === word.length - 1) { if (wordIndex === word.length - 1) {
return textIndex - word.length + 1; return (textIndex - word.length) + 1;
} }
wordIndex += 1; wordIndex += 1;
textIndex += 1; textIndex += 1;