mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2024-11-23 21:11:08 +00:00
Code Issues Packages Projects Releases Wiki Activity

Fix some typos (#6113)

Browse Source 
* Fix some typos.

* Update volume.py

Co-authored-by: John Law <johnlaw.po@gmail.com>
This commit is contained in:
Shuangchi He 2022-05-01 18:44:23 +08:00 committed by GitHub
parent a7e4b2326a
commit e1ec661d4e
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
5 changed files with 6 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
ciphers/shuffled_shift_cipher.py
View File

@ -9,7 +9,7 @@ class ShuffledShiftCipher:
This algorithm uses the Caesar Cipher algorithm but removes the option to This algorithm uses the Caesar Cipher algorithm but removes the option to
use brute force to decrypt the message. use brute force to decrypt the message.
The passcode is a a random password from the selection buffer of The passcode is a random password from the selection buffer of
1. uppercase letters of the English alphabet 1. uppercase letters of the English alphabet
2. lowercase letters of the English alphabet 2. lowercase letters of the English alphabet
3. digits from 0 to 9 3. digits from 0 to 9

2
data_structures/stacks/dijkstras_two_stack_algorithm.py
View File

@ -10,7 +10,7 @@ such as: (5 + ((4 * 2) * (2 + 3)))
THESE ARE THE ALGORITHM'S RULES: THESE ARE THE ALGORITHM'S RULES:
RULE 1: Scan the expression from left to right. When an operand is encountered, RULE 1: Scan the expression from left to right. When an operand is encountered,
push it onto the the operand stack. push it onto the operand stack.
RULE 2: When an operator is encountered in the expression, RULE 2: When an operator is encountered in the expression,
push it onto the operator stack. push it onto the operator stack.

2
divide_and_conquer/inversions.py
View File

@ -11,7 +11,7 @@ algorithm which runs in nlogn and the brute-force n^2 algorithm.
def count_inversions_bf(arr): def count_inversions_bf(arr):
""" """
Counts the number of inversions using a a naive brute-force algorithm Counts the number of inversions using a naive brute-force algorithm
Parameters Parameters
---------- ----------
arr: arr: array-like, the list containing the items for which the number arr: arr: array-like, the list containing the items for which the number

4
maths/volume.py
View File

@ -38,8 +38,8 @@ def vol_spheres_intersect(
Calculate the volume of the intersection of two spheres. Calculate the volume of the intersection of two spheres.
The intersection is composed by two spherical caps and therefore its volume is the The intersection is composed by two spherical caps and therefore its volume is the
sum of the volumes of the spherical caps. First it calculates the heights (h1, h2) sum of the volumes of the spherical caps. First, it calculates the heights (h1, h2)
of the the spherical caps, then the two volumes and it returns the sum. of the spherical caps, then the two volumes and it returns the sum.
The height formulas are The height formulas are
h1 = (radius_1 - radius_2 + centers_distance) h1 = (radius_1 - radius_2 + centers_distance)
* (radius_1 + radius_2 - centers_distance) * (radius_1 + radius_2 - centers_distance)

2
strings/manacher.py
View File

@ -88,7 +88,7 @@ iv) a1 is corresponding equal character of a5 in palindrome with center a3 (reme
now for a5 we will calculate the length of palindromic substring with center as a5 but now for a5 we will calculate the length of palindromic substring with center as a5 but
can we use previously calculated information in some way? can we use previously calculated information in some way?
Yes, look the above string we know that a5 is inside the palindrome with center a3 and Yes, look the above string we know that a5 is inside the palindrome with center a3 and
previously we have have calculated that previously we have calculated that
a0==a2 (palindrome of center a1) a0==a2 (palindrome of center a1)
a2==a4 (palindrome of center a3) a2==a4 (palindrome of center a3)
a0==a6 (palindrome of center a3) a0==a6 (palindrome of center a3)