From 985c0bf2f2b75d069754f809ea76ed83f0d3191b Mon Sep 17 00:00:00 2001
From: unknown <ninja990621@gmail.com>
Date: Tue, 4 Nov 2025 16:44:33 +0000
Subject: [PATCH] docs: Complete XML documentation comments for sorting and
 numeric algorithms

---
 Algorithms/Knapsack/NaiveKnapsackSolver.cs          | 13 +++++++------
 .../EuclideanGreatestCommonDivisorFinder.cs         |  6 +++---
 .../Sorters/Comparison/BinaryInsertionSorter.cs     |  6 +++---
 Algorithms/Sorters/Comparison/BogoSorter.cs         | 12 +++++++++---
 Algorithms/Sorters/Comparison/ShellSorter.cs        |  4 ++--
 5 files changed, 24 insertions(+), 17 deletions(-)

diff --git a/Algorithms/Knapsack/NaiveKnapsackSolver.cs b/Algorithms/Knapsack/NaiveKnapsackSolver.cs
index 38a4f93d..010ba68d 100644
--- a/Algorithms/Knapsack/NaiveKnapsackSolver.cs
+++ b/Algorithms/Knapsack/NaiveKnapsackSolver.cs
@@ -7,13 +7,14 @@ namespace Algorithms.Knapsack;
 public class NaiveKnapsackSolver<T> : IHeuristicKnapsackSolver<T>
 {
     /// <summary>
-    ///     TODO.
+    ///     Solves the knapsack problem using a naive greedy approach.
+    ///     Items are added in order until capacity is reached.
     /// </summary>
-    /// <param name="items">TODO. 2.</param>
-    /// <param name="capacity">TODO. 3.</param>
-    /// <param name="weightSelector">TODO. 4.</param>
-    /// <param name="valueSelector">TODO. 5.</param>
-    /// <returns>TODO. 6.</returns>
+    /// <param name="items">Array of items to consider for the knapsack.</param>
+    /// <param name="capacity">Maximum weight capacity of the knapsack.</param>
+    /// <param name="weightSelector">Function to get the weight of an item.</param>
+    /// <param name="valueSelector">Function to get the value of an item.</param>
+    /// <returns>Array of items that fit in the knapsack.</returns>
     public T[] Solve(T[] items, double capacity, Func<T, double> weightSelector, Func<T, double> valueSelector)
     {
         var weight = 0d;
diff --git a/Algorithms/Numeric/GreatestCommonDivisor/EuclideanGreatestCommonDivisorFinder.cs b/Algorithms/Numeric/GreatestCommonDivisor/EuclideanGreatestCommonDivisorFinder.cs
index df93caf9..f3c64431 100644
--- a/Algorithms/Numeric/GreatestCommonDivisor/EuclideanGreatestCommonDivisorFinder.cs
+++ b/Algorithms/Numeric/GreatestCommonDivisor/EuclideanGreatestCommonDivisorFinder.cs
@@ -1,7 +1,7 @@
 namespace Algorithms.Numeric.GreatestCommonDivisor;
 
 /// <summary>
-///     TODO.
+///     Euclidean algorithm for finding the greatest common divisor.
 /// </summary>
 public class EuclideanGreatestCommonDivisorFinder : IGreatestCommonDivisorFinder
 {
@@ -9,8 +9,8 @@ public class EuclideanGreatestCommonDivisorFinder : IGreatestCommonDivisorFinder
     ///     Finds greatest common divisor for numbers a and b
     ///     using euclidean algorithm.
     /// </summary>
-    /// <param name="a">TODO.</param>
-    /// <param name="b">TODO. 2.</param>
+    /// <param name="a">First number.</param>
+    /// <param name="b">Second number.</param>
     /// <returns>Greatest common divisor.</returns>
     public int FindGcd(int a, int b)
     {
diff --git a/Algorithms/Sorters/Comparison/BinaryInsertionSorter.cs b/Algorithms/Sorters/Comparison/BinaryInsertionSorter.cs
index e6380673..36fc2354 100644
--- a/Algorithms/Sorters/Comparison/BinaryInsertionSorter.cs
+++ b/Algorithms/Sorters/Comparison/BinaryInsertionSorter.cs
@@ -1,9 +1,9 @@
 namespace Algorithms.Sorters.Comparison;
 
 /// <summary>
-///     TODO.
+///     Class that implements binary insertion sort algorithm.
 /// </summary>
-/// <typeparam name="T">TODO. 2.</typeparam>
+/// <typeparam name="T">Type of array element.</typeparam>
 public class BinaryInsertionSorter<T> : IComparisonSorter<T>
 {
     /// <summary>
@@ -37,7 +37,7 @@ public void Sort(T[] array, IComparer<T> comparer)
     /// <param name="from">Left index to search from (inclusive).</param>
     /// <param name="to">Right index to search to (inclusive).</param>
     /// <param name="target">The value to find placefor in the provided array.</param>
-    /// <param name="comparer">TODO.</param>
+    /// <param name="comparer">Compares elements.</param>
     /// <returns>The index where to insert target value.</returns>
     private static int BinarySearch(T[] array, int from, int to, T target, IComparer<T> comparer)
     {
diff --git a/Algorithms/Sorters/Comparison/BogoSorter.cs b/Algorithms/Sorters/Comparison/BogoSorter.cs
index f419a331..c33812b1 100644
--- a/Algorithms/Sorters/Comparison/BogoSorter.cs
+++ b/Algorithms/Sorters/Comparison/BogoSorter.cs
@@ -9,10 +9,16 @@ public class BogoSorter<T> : IComparisonSorter<T>
     private readonly Random random = new();
 
     /// <summary>
-    ///     TODO.
+    ///     Sorts array using specified comparer,
+    ///     randomly shuffles elements until array is sorted,
+    ///     internal, in-place, unstable,
+    ///     worst-case time complexity: unbounded (infinite),
+    ///     average time complexity: O((n+1)!),
+    ///     space complexity: O(n),
+    ///     where n - array length.
     /// </summary>
-    /// <param name="array">TODO. 2.</param>
-    /// <param name="comparer">TODO. 3.</param>
+    /// <param name="array">Array to sort.</param>
+    /// <param name="comparer">Compares elements.</param>
     public void Sort(T[] array, IComparer<T> comparer)
     {
         while (!IsSorted(array, comparer))
diff --git a/Algorithms/Sorters/Comparison/ShellSorter.cs b/Algorithms/Sorters/Comparison/ShellSorter.cs
index 046069b1..8e27ded5 100644
--- a/Algorithms/Sorters/Comparison/ShellSorter.cs
+++ b/Algorithms/Sorters/Comparison/ShellSorter.cs
@@ -1,9 +1,9 @@
 namespace Algorithms.Sorters.Comparison;
 
 /// <summary>
-///     TODO.
+///     Class that implements Shell sort algorithm.
 /// </summary>
-/// <typeparam name="T">TODO. 2.</typeparam>
+/// <typeparam name="T">Type of array element.</typeparam>
 public class ShellSorter<T> : IComparisonSorter<T>
 {
     /// <summary>