diff --git a/src/main/java/com/thealgorithms/io/BufferedReader.java b/src/main/java/com/thealgorithms/io/BufferedReader.java index 7909eaa96eae..477a52bb5c30 100644 --- a/src/main/java/com/thealgorithms/io/BufferedReader.java +++ b/src/main/java/com/thealgorithms/io/BufferedReader.java @@ -16,7 +16,7 @@ public class BufferedReader { private static final int DEFAULT_BUFFER_SIZE = 5; /** - * Maximum number of bytes the buffer can hold. + * The maximum number of bytes the buffer can hold. * Value is changed when encountered Eof to not * cause overflow read of 0 bytes */ @@ -100,7 +100,7 @@ public int peek(int n) throws IOException { * Removes the already read bytes from the buffer * in-order to make space for new bytes to be filled up. *
- * This may also do the job to read first time data (whole buffer is empty) + * This may also do the job to read first time data (the whole buffer is empty) */ private void pushRefreshData() throws IOException { @@ -116,7 +116,7 @@ private void pushRefreshData() throws IOException { /** * Reads one complete block of size {bufferSize} - * if found eof, the total length of array will + * if found eof, the total length of an array will * be that of what's available * * @return a completed block diff --git a/src/main/java/com/thealgorithms/maths/AmicableNumber.java b/src/main/java/com/thealgorithms/maths/AmicableNumber.java index 7e7b454ac18a..23c90888ec5d 100644 --- a/src/main/java/com/thealgorithms/maths/AmicableNumber.java +++ b/src/main/java/com/thealgorithms/maths/AmicableNumber.java @@ -15,9 +15,9 @@ *
* link: https://en.wikipedia.org/wiki/Amicable_numbers *
- * Simple Example : (220, 284) - * 220 is divisible by {1,2,4,5,10,11,20,22,44,55,110} <- SUM = 284 - * 284 is divisible by {1,2,4,71,142} <- SUM = 220. + * Simple Example: (220, 284) + * 220 is divisible by {1,2,4,5,10,11,20,22,44,55,110} <-SUM = 284 + * 284 is divisible by {1,2,4,71,142} <-SUM = 220. */ public class AmicableNumber { /**