It's all a bit messy really. I think I can improve on it.

The solution has written using the recursive CTE

Using a CTE with recursion. I did not test for more than the default 32 levels of recursion.

The solution is based on using the recursive CTE,And used the string function to wrap the strings

The solution is based on using recursive CTE. iF THE WORD length is greater than wrapposition then appending "-" and if the word legth identified based on the first and last index of ' ' is less than wrapposition then moving the wrod to next row.

The solution is based on recursive CTE and logic used is given below. If the word length is greater than the wrapposition and the word splitted based on the wrapposition is equal to wrapposition then appending"-". 2.to split the word that fits the leng

Nothing fancy here, regular recursive CTE to find solution. Performs decently but not extraordinary well.