From 0907e369acb4a8a072a0d6387fd764fd9dc1ef5e Mon Sep 17 00:00:00 2001
From: Arindam Debnath <64245681+dovahkiin0022@users.noreply.github.com>
Date: Fri, 1 Mar 2024 11:41:39 -0500
Subject: [PATCH] Update nimcso.nim

Fixed minor typos in the docstrings
---
 src/nimcso.nim | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/src/nimcso.nim b/src/nimcso.nim
index 3d35730..219fd06 100644
--- a/src/nimcso.nim
+++ b/src/nimcso.nim
@@ -664,7 +664,7 @@ proc bruteForce*(verbose: bool = true): seq[ElSolution] =
 
 proc bruteForceInt*(verbose: bool = true): seq[ElSolution] =
     ## **(Key Routine)** A **really high performance** (400 times faster than native Python and 50 times faster than NumPy) brute force algorithm for finding the optimal solution for the problem of which 
-    ## N elements to remove from dataset to loose the least daya. Unlike the standard `bruteForce`_ algorithm does not use the `ElSolution`_ type and **cannot be easily extended** to other use cases and 
+    ## N elements to remove from dataset to lose the least data. Unlike the standard `bruteForce`_ algorithm does not use the `ElSolution`_ type and **cannot be easily extended** to other use cases and 
     ## **cannot be used for more than 64 elements** without sacrificing the performance, at which point `bruteForce`_ should be much better choice.
     assert elementN <= 64, "Brute Force with uint64 representation cannot run on more than 64 elements. You will need to take `bruteForce` instead and implement it for more than 64 elements."
     if verbose: styledEcho "\nRunning brute force algorithm for ", styleBright, fgMagenta, $elementN, resetStyle, " elements and ", styleBright, fgMagenta, $dataN, " data points."