Refactor conditionals for clarity in suffix_array_short.hpp

Author: lrvideckis

library/strings/suffix_array/suffix_array_short.hpp

@@ -23,8 +23,9 @@ auto sa_short(const auto& s) {
         int a = i1 + j * k < n ? x[i1 + j * k] : -1;
         int b = i2 + j * k < n ? x[i2 + j * k] : -1;
         if (a != b) {
-          if (a != -1) assert(a<n-1),val += y[a];
-          else val = n - i1;
+          if (a != -1) {
+            if(a<n-1)val += y[a];
+          } else val = n - i1;
           return a < b;
         }
         val += j;