That’s unfortunate; I think the KP line breaking algorithm is one of my favorites. Obviously, it’s not as fast as greedy, but it is “mostly” linear. Here’s my n

That’s unfortunate; I think the KP line breaking algorithm is one of my favorites. Obviously, it’s not as fast as greedy, but it is “mostly” linear. Here’s my notes & some C++ code… https://github.com/jaroslov/knuth-plass-thoughts/blob/master/plass.md https://github.com/jaroslov/knuth-plass-thoughts/blob/master...