chore: add GlobalUsings.cs with project-wide using directives for Algorithms folder

Algorithms/Crypto/Digests/AsconDigest.cs

@@ -1,4 +1,3 @@
-using System;
 using System.Runtime.CompilerServices;
 using Algorithms.Crypto.Utils;
 

Algorithms/Crypto/Digests/IDigest.cs

@@ -1,5 +1,3 @@
-using System;
-
 namespace Algorithms.Crypto.Digests;
 
 /// <summary>

Algorithms/Crypto/Digests/Md2Digest.cs

@@ -1,6 +1,4 @@
-using System;
-
-namespace Algorithms.Crypto.Digests;
+namespace Algorithms.Crypto.Digests;
 
 /// <summary>
 /// MD2 is a cryptographic hash function that takes an input message and produces a 128-bit output, also called a message

Algorithms/Crypto/Exceptions/CryptoException.cs

@@ -1,5 +1,3 @@
-using System;
-
 namespace Algorithms.Crypto.Exceptions;
 
 /// <summary>

Algorithms/Crypto/Exceptions/DataLengthException.cs

@@ -1,5 +1,3 @@
-using System;
-
 namespace Algorithms.Crypto.Exceptions;
 
 /// <summary>

Algorithms/Crypto/Exceptions/OutputLengthException.cs

@@ -1,5 +1,3 @@
-using System;
-
 namespace Algorithms.Crypto.Exceptions;
 
 /// <summary>

Algorithms/Crypto/Paddings/IBlockCipherPadding.cs

@@ -1,6 +1,4 @@
-using System;
-
-namespace Algorithms.Crypto.Paddings;
+namespace Algorithms.Crypto.Paddings;
 
 /// <summary>
 /// A common interface that all block cipher padding schemes should follow.

Algorithms/Crypto/Paddings/Iso10126D2Padding.cs

@@ -1,7 +1,4 @@
-using System;
-using System.Security.Cryptography;
-
-namespace Algorithms.Crypto.Paddings;
+namespace Algorithms.Crypto.Paddings;
 
 /// <summary>
 /// <para>

Algorithms/Crypto/Paddings/Iso7816D4Padding.cs

@@ -1,6 +1,4 @@
-using System;
-
-namespace Algorithms.Crypto.Paddings;
+namespace Algorithms.Crypto.Paddings;
 
 /// <summary>
 /// <para>

Algorithms/Crypto/Paddings/Pkcs7Padding.cs

@@ -1,6 +1,4 @@
-using System;
-
-namespace Algorithms.Crypto.Paddings;
+namespace Algorithms.Crypto.Paddings;
 
 /// <summary>
 /// <para>

Algorithms/Crypto/Paddings/TbcPadding.cs

@@ -1,6 +1,4 @@
-using System;
-
-namespace Algorithms.Crypto.Paddings;
+namespace Algorithms.Crypto.Paddings;
 
 /// <summary>
 /// <para>

Algorithms/Crypto/Paddings/X932Padding.cs

@@ -1,7 +1,4 @@
-using System;
-using System.Security.Cryptography;
-
-namespace Algorithms.Crypto.Paddings;
+namespace Algorithms.Crypto.Paddings;
 
 /// <summary>
 /// <para>

Algorithms/Crypto/Utils/ByteEncodingUtils.cs

@@ -1,4 +1,3 @@
-using System;
 using System.Buffers.Binary;
 using System.Runtime.CompilerServices;
 

Algorithms/Crypto/Utils/LongUtils.cs

@@ -1,5 +1,3 @@
-using System.Numerics;
-
 namespace Algorithms.Crypto.Utils;
 
 /// <summary>

Algorithms/Crypto/Utils/ValidationUtils.cs

@@ -1,5 +1,3 @@
-using System;
-using System.Diagnostics;
 using Algorithms.Crypto.Exceptions;
 
 namespace Algorithms.Crypto.Utils;

Algorithms/DataCompression/BurrowsWheelerTransform.cs

@@ -1,6 +1,3 @@
-using System;
-using System.Linq;
-
 namespace Algorithms.DataCompression;
 
 /// <summary>

Algorithms/DataCompression/HuffmanCompressor.cs

@@ -1,8 +1,4 @@
-using System;
-using System.Collections.Generic;
-using System.Linq;
 using Algorithms.Sorters.Comparison;
-using Utilities.Extensions;
 
 namespace Algorithms.DataCompression;
 

Algorithms/DataCompression/ShannonFanoCompressor.cs

@@ -1,7 +1,4 @@
-using System.Collections.Generic;
-using System.Linq;
 using Algorithms.Knapsack;
-using Utilities.Extensions;
 
 namespace Algorithms.DataCompression;
 

Algorithms/DataCompression/Translator.cs

@@ -1,6 +1,3 @@
-using System.Collections.Generic;
-using System.Text;
-
 namespace Algorithms.DataCompression;
 
 /// <summary>

Algorithms/Encoders/AutokeyEncorder.cs

@@ -1,8 +1,3 @@
-using System;
-using System.Globalization;
-using System.Text;
-using System.Text.RegularExpressions;
-
 namespace Algorithms.Encoders
 {
     /// <summary>
@@ -27,7 +22,7 @@ public string Encode(string plainText, string keyword)
 
             StringBuilder cipherText = new StringBuilder();
 
-            for(int i = 0; i < plainText.Length; i++)
+            for (int i = 0; i < plainText.Length; i++)
             {
                 char plainCharacter = plainText[i];
                 char keyCharacter = keyword[i];
@@ -53,7 +48,7 @@ public string Decode(string cipherText, string keyword)
             StringBuilder plainText = new StringBuilder();
             StringBuilder extendedKeyword = new StringBuilder(keyword);
 
-            for(int i = 0; i < cipherText.Length; i++)
+            for (int i = 0; i < cipherText.Length; i++)
             {
                 char cipherCharacter = cipherText[i];
                 char keywordCharacter = extendedKeyword[i];

Algorithms/Encoders/BlowfishEncoder.cs

@@ -1,8 +1,4 @@
-using System;
-using System.Linq;
-using System.Text;
-
-namespace Algorithms.Encoders;
+namespace Algorithms.Encoders;
 
 /// <summary>
 /// <para>

Algorithms/Encoders/CaesarEncoder.cs

@@ -1,5 +1,3 @@
-using System.Text;
-
 namespace Algorithms.Encoders;
 
 /// <summary>

Algorithms/Encoders/FeistelCipher.cs

@@ -1,7 +1,3 @@
-using System;
-using System.Collections.Generic;
-using System.Text;
-
 namespace Algorithms.Encoders;
 
 /// <summary>
@@ -101,7 +97,7 @@ public string Decode(string text, uint key)
             ulong decodedBlock = leftSubblock;
             decodedBlock = (decodedBlock << 32) | rightSubblock;
 
-            for(int i = 0; i < 8; i++)
+            for (int i = 0; i < 8; i++)
             {
                 ulong a = (decodedBlock & 0xFF00000000000000) >> 56;
 
@@ -125,7 +121,7 @@ private static List<ulong> SplitTextToBlocks(string text)
         List<ulong> blocksListPlain = new();
         byte[] textArray = Encoding.ASCII.GetBytes(text);
         int offset = 8;
-        for(int i = 0; i < text.Length; i += 8)
+        for (int i = 0; i < text.Length; i += 8)
         {
             // text not always has len%16 == 0, that's why the offset should be adjusted for the last part of the text
             if (i > text.Length - 8)
@@ -144,7 +140,7 @@ private static List<ulong> SplitTextToBlocks(string text)
     private static List<ulong> GetBlocksFromEncodedText(string text)
     {
         List<ulong> blocksListPlain = new();
-        for(int i = 0; i < text.Length; i += 16)
+        for (int i = 0; i < text.Length; i += 16)
         {
             ulong block = Convert.ToUInt64(text.Substring(i, 16), 16);
             blocksListPlain.Add(block);

Algorithms/Encoders/HillEncoder.cs

@@ -1,5 +1,3 @@
-using System;
-using System.Linq;
 using Algorithms.Numeric;
 
 namespace Algorithms.Encoders;

Algorithms/Encoders/NysiisEncoder.cs

@@ -1,7 +1,3 @@
-using System.Globalization;
-using System.Linq;
-using System.Text;
-
 namespace Algorithms.Encoders;
 
 /// <summary>

Algorithms/Encoders/SoundexEncoder.cs

@@ -1,6 +1,3 @@
-using System.Collections.Generic;
-using System.Linq;
-
 namespace Algorithms.Encoders;
 
 /// <summary>

Algorithms/Encoders/VigenereEncoder.cs

@@ -1,6 +1,3 @@
-using System;
-using System.Text;
-
 namespace Algorithms.Encoders;
 
 /// <summary>

Algorithms/Financial/PresentValue.cs

@@ -1,7 +1,3 @@
-using System;
-using System.Collections.Generic;
-using System.Linq;
-
 namespace Algorithms.Financial;
 
 /// <summary>

Algorithms/GlobalUsings.cs

@@ -0,0 +1,21 @@
+// -----------------------------------------------------------------------------
+// Global using directives for the C-Sharp solution.
+// These namespaces are imported globally so they don’t need to be repeatedly declared
+// in individual files, improving readability and reducing boilerplate.
+//
+// Guidelines:
+// - Keep only the most commonly used namespaces here.
+// - Add project-specific namespaces (e.g., Utilities.Extensions) only if they are
+//   required across the majority of files in the project.
+// - Avoid placing rarely used namespaces here to maintain clarity.
+// -----------------------------------------------------------------------------
+
+global using System;                        // Core base classes and fundamental types
+global using System.Collections.Generic;    // Generic collection types (List, Dictionary, etc.)
+global using System.Globalization;          // Culture-related information (dates, numbers, formatting)
+global using System.Linq;                   // LINQ query operators for collections
+global using System.Numerics;               // Numeric types such as BigInteger and Complex
+global using System.Security.Cryptography;  // Cryptographic services (hashing, encryption, random numbers)
+global using System.Text;                   // Text encoding, StringBuilder, etc.
+global using System.Text.RegularExpressions; // Regular expression support
+global using Utilities.Extensions;          // Common extension methods used across the solution

Algorithms/Graph/BellmanFord.cs

@@ -1,5 +1,3 @@
-using System;
-using System.Collections.Generic;
 using DataStructures.Graph;
 
 namespace Algorithms.Graph;

Algorithms/Graph/BreadthFirstSearch.cs

@@ -1,5 +1,3 @@
-using System;
-using System.Collections.Generic;
 using DataStructures.Graph;
 
 namespace Algorithms.Graph;

Algorithms/Graph/BreadthFirstTreeTraversal.cs

@@ -1,5 +1,3 @@
-using System;
-using System.Collections.Generic;
 using DataStructures.BinarySearchTree;
 
 namespace Algorithms.Graph;

Algorithms/Graph/DepthFirstSearch.cs

@@ -1,5 +1,3 @@
-using System;
-using System.Collections.Generic;
 using DataStructures.Graph;
 
 namespace Algorithms.Graph;

Algorithms/Graph/Dijkstra/DijkstraAlgorithm.cs

@@ -1,6 +1,3 @@
-using System;
-using System.Collections.Generic;
-using System.Linq;
 using DataStructures.Graph;
 
 namespace Algorithms.Graph.Dijkstra;
@@ -31,7 +28,7 @@ public static DistanceModel<T>[] GenerateShortestPath<T>(DirectedWeightedGraph<T
 
         while (visitedVertices.Count != distanceArray.Length && distanceRecord.Count != 0)
         {
-            while(visitedVertices.Contains(distanceRecord.Peek().Vertex!))
+            while (visitedVertices.Contains(distanceRecord.Peek().Vertex!))
             {
                 distanceRecord.Dequeue();
             }

Algorithms/Graph/FloydWarshall.cs

@@ -1,4 +1,3 @@
-using System;
 using DataStructures.Graph;
 
 namespace Algorithms.Graph;

Algorithms/Graph/IGraphSearch.cs

@@ -1,4 +1,3 @@
-using System;
 using DataStructures.Graph;
 
 namespace Algorithms.Graph;

Algorithms/Graph/Kosaraju.cs

@@ -1,5 +1,3 @@
-using System.Collections.Generic;
-using System.Linq;
 using DataStructures.Graph;
 
 namespace Algorithms.Graph;

Algorithms/Graph/MinimumSpanningTree/Kruskal.cs

@@ -1,5 +1,3 @@
-using System;
-using System.Collections.Generic;
 using DataStructures.DisjointSet;
 
 namespace Algorithms.Graph.MinimumSpanningTree;
@@ -97,7 +95,7 @@ public static Dictionary<int, float>[] Solve(Dictionary<int, float>[] adjacencyL
         {
             nodes[i] = set.MakeSet(i);
 
-            foreach(var (node, weight) in adjacencyList[i])
+            foreach (var (node, weight) in adjacencyList[i])
             {
                 edgeWeightList.Add(weight);
                 nodeConnectList.Add((i, node));

Algorithms/Graph/MinimumSpanningTree/PrimMatrix.cs

@@ -1,5 +1,3 @@
-using System;
-
 namespace Algorithms.Graph.MinimumSpanningTree;
 
 /// <summary>

Algorithms/Knapsack/BranchAndBoundKnapsackSolver.cs

@@ -1,7 +1,3 @@
-using System;
-using System.Collections.Generic;
-using System.Linq;
-
 namespace Algorithms.Knapsack;
 
 /// <summary>
@@ -111,7 +107,7 @@ private static T[] GetItemsFromPath(T[] items, BranchAndBoundNode lastNodeOfPath
         // only bogus initial node has no parent
         for (var current = lastNodeOfPath; current.Parent is not null; current = current.Parent)
         {
-            if(current.IsTaken)
+            if (current.IsTaken)
             {
                 takenItems.Add(items[current.Level]);
             }

Algorithms/Knapsack/DynamicProgrammingKnapsackSolver.cs

@@ -1,6 +1,3 @@
-using System;
-using System.Collections.Generic;
-
 namespace Algorithms.Knapsack;
 
 /// <summary>

Algorithms/Knapsack/IHeuristicKnapsackSolver.cs

@@ -1,5 +1,3 @@
-using System;
-
 namespace Algorithms.Knapsack;
 
 /// <summary>

Algorithms/Knapsack/NaiveKnapsackSolver.cs

@@ -1,6 +1,3 @@
-using System;
-using System.Collections.Generic;
-
 namespace Algorithms.Knapsack;
 
 /// <summary>

Algorithms/LinearAlgebra/Distances/Chebyshev.cs

@@ -1,6 +1,3 @@
-using System;
-using System.Linq;
-
 namespace Algorithms.LinearAlgebra.Distances;
 
 /// <summary>

Algorithms/LinearAlgebra/Distances/Euclidean.cs

@@ -1,6 +1,3 @@
-using System;
-using System.Linq;
-
 namespace Algorithms.LinearAlgebra.Distances;
 
 /// <summary>