TheAlgorithms · k1ngmang · Jun 30, 2025 · Jun 30, 2025 · Jun 30, 2025
diff --git a/.gitignore b/.gitignore
@@ -1,5 +1,5 @@
 .DS_Store
-.idea/shelf
+/.idea/
 /android.tests.dependencies
 /confluence/target
 /dependencies/repo
@@ -29,4 +29,4 @@ node_modules/
 .rpt2_cache/
 libraries/tools/kotlin-test-nodejs-runner/lib/
 .idea/jarRepositories.xml
-.idea/misc.xml
+.idea/misc.xml
diff --git a/.idea/codeStyles/Project.xml b/.idea/codeStyles/Project.xml
diff --git a/.idea/codeStyles/codeStyleConfig.xml b/.idea/codeStyles/codeStyleConfig.xml
diff --git a/.idea/encodings.xml b/.idea/encodings.xml
diff --git a/.idea/misc.xml b/.idea/misc.xml
diff --git a/.idea/vcs.xml b/.idea/vcs.xml
diff --git a/src/main/kotlin/dynamicProgramming/Factorial.kt b/src/main/kotlin/dynamicProgramming/Factorial.kt
@@ -1,5 +1,11 @@
 package dynamicProgramming
 
+/**
+ * This is a tail-recursive implementation of factorial calculation.
+ * @param n - the number to calculate factorial for
+ * @param accumulator - accumulates the factorial value (default is 1)
+ * @return factorial of the input number
+ */
 tailrec fun factorial(n: Int, accumulator: Int = 1): Int {
     if (n == 0) {
         return accumulator

diff --git a/...mic_programming/PalindromePartitioning.kt → ...amicProgramming/PalindromePartitioning.kt b/...mic_programming/PalindromePartitioning.kt → ...amicProgramming/PalindromePartitioning.kt
diff --git a/src/main/kotlin/dynamicProgramming/isPrime.kt b/src/main/kotlin/dynamicProgramming/isPrime.kt
@@ -1,3 +1,8 @@
 package dynamicProgramming
 
-fun Int.isPrime() = this > 1 && (2..(this / 2)).all { this % it != 0 }
+/**
+ * Extension function that checks if an integer is a prime number.
+ * A prime number is a natural number greater than 1 that has no positive divisors other than 1 and itself.
+ * @return true if the number is prime, false otherwise
+ */
+fun Int.isPrime() = this > 1 && (2..(this / 2)).all { this % it != 0 }
diff --git a/src/main/kotlin/other/Palindrome.kt b/src/main/kotlin/other/Palindrome.kt