update

Author: Alex

ChessKnight.c

@@ -146,11 +146,9 @@ int main(int argc, char *argv[])
         for(int8_t i1=cl; i1>0; i1--)
         {
           int8_t i0=i1-1;
-          if(ta[i1]>ta[i0])
+          if(ta[i0]<ta[i1])
           {
-            uint8_t tmp;
-            tmp=ta[i0]; ta[i0]=ta[i1]; ta[i1]=tmp;
-            tmp=ti[i0]; ti[i0]=ti[i1]; ti[i1]=tmp;
+            uint8_t tmp1=ta[i0]; uint8_t tmp2=ti[i0]; ta[i0]=ta[i1]; ti[i0]=ti[i1]; ta[i1]=tmp1; ti[i1]=tmp2;
           }
           else break;
         }
@@ -488,8 +486,7 @@ int main(int argc, char *argv[])
           int8_t i1=i0+1; // i1 must be uint8_t, but int8_t faster - O3 work strange
           if(ta[i0]<ta[i1])
           {
-            uint8_t tmp1=ta[i1]; ta[i1]=ta[i0]; ta[i0]=tmp1;
-            uint8_t tmp2=ti[i1]; ti[i1]=ti[i0]; ti[i0]=tmp2;
+            uint8_t tmp1=ta[i1]; uint8_t tmp2=ti[i1]; ta[i1]=ta[i0]; ti[i1]=ti[i0]; ta[i0]=tmp1; ti[i0]=tmp2;
           }
         }
       }

README.md

@@ -53,9 +53,9 @@ a very wide range of tasks using the Far and Windows API's.
 
 ## [ChessKnight.c](https://github.com/z0hm/far-scripts/blob/master/ChessKnight.c "ChessKnight.c")
 
-  *v0.9.2.4 (24147 bytes, changed 2025-02-22 17:43)*
+  *v0.9.2.4 (24115 bytes, changed 2025-02-23 15:22)*
 
-  *SHA-256 `5806783d5146f1f2415efed81ff9728d6b8198dd07cb8a16243f4d4760b95dd3`*
+  *SHA-256 `1c3801df371974959e06a816ea84f8f80cad9dd94c068e6ada67f870a5678697`*
 
   For fast find solution, put the compiled ChessKnight.exe to one folder with ChessKnight.lua