Skip to content

Commit c42e73b

Browse files
chore: fix typos in src/main/java/com/thealgorithms/others/MemoryManagementAlgorithms.java (#7043)
Fix typos in src/main/java/com/thealgorithms/others/MemoryManagementAlgorithms.java Co-authored-by: a <[email protected]>
1 parent 2ff2849 commit c42e73b

File tree

1 file changed

+5
-5
lines changed

1 file changed

+5
-5
lines changed

src/main/java/com/thealgorithms/others/MemoryManagementAlgorithms.java

Lines changed: 5 additions & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -16,7 +16,7 @@ public abstract class MemoryManagementAlgorithms {
1616
* blocks available.
1717
* @param sizeOfProcesses: an int array that contains the sizes of the
1818
* processes we need memory blocks for.
19-
* @return the ArrayList filled with Integers repressenting the memory
19+
* @return the ArrayList filled with Integers representing the memory
2020
* allocation that took place.
2121
*/
2222
public abstract ArrayList<Integer> fitProcess(int[] sizeOfBlocks, int[] sizeOfProcesses);
@@ -91,7 +91,7 @@ private static int findBestFit(int[] blockSizes, int processSize) {
9191
* blocks available.
9292
* @param sizeOfProcesses: an int array that contains the sizes of the
9393
* processes we need memory blocks for.
94-
* @return the ArrayList filled with Integers repressenting the memory
94+
* @return the ArrayList filled with Integers representing the memory
9595
* allocation that took place.
9696
*/
9797
public ArrayList<Integer> fitProcess(int[] sizeOfBlocks, int[] sizeOfProcesses) {
@@ -149,7 +149,7 @@ private static int findWorstFit(int[] blockSizes, int processSize) {
149149
* blocks available.
150150
* @param sizeOfProcesses: an int array that contains the sizes of the
151151
* processes we need memory blocks for.
152-
* @return the ArrayList filled with Integers repressenting the memory
152+
* @return the ArrayList filled with Integers representing the memory
153153
* allocation that took place.
154154
*/
155155
public ArrayList<Integer> fitProcess(int[] sizeOfBlocks, int[] sizeOfProcesses) {
@@ -201,7 +201,7 @@ private static int findFirstFit(int[] blockSizes, int processSize) {
201201
* blocks available.
202202
* @param sizeOfProcesses: an int array that contains the sizes of the
203203
* processes we need memory blocks for.
204-
* @return the ArrayList filled with Integers repressenting the memory
204+
* @return the ArrayList filled with Integers representing the memory
205205
* allocation that took place.
206206
*/
207207
public ArrayList<Integer> fitProcess(int[] sizeOfBlocks, int[] sizeOfProcesses) {
@@ -262,7 +262,7 @@ private int findNextFit(int[] blockSizes, int processSize) {
262262
* blocks available.
263263
* @param sizeOfProcesses: an int array that contains the sizes of the
264264
* processes we need memory blocks for.
265-
* @return the ArrayList filled with Integers repressenting the memory
265+
* @return the ArrayList filled with Integers representing the memory
266266
* allocation that took place.
267267
*/
268268
public ArrayList<Integer> fitProcess(int[] sizeOfBlocks, int[] sizeOfProcesses) {

0 commit comments

Comments
 (0)