undefined | Better HN

0 pointsjameshart3y ago0 comments

Actually it turns out it's O(n). Which goes to show that constant factors can be more important than you think when looking at raw time complexity big-O.

0 comments

nullc3y ago

Ehhhh, it's O(n) when the string to be reversed is bounded under its input window.

Because of self-attention it would grow quadratically for larger inputs, no?

j / k navigate · click thread line to collapse

0 pointsjameshart3y ago0 comments

Actually it turns out it's O(n). Which goes to show that constant factors can be more important than you think when looking at raw time complexity big-O.

0 comments

nullc3y ago

Ehhhh, it's O(n) when the string to be reversed is bounded under its input window.

Because of self-attention it would grow quadratically for larger inputs, no?

j / k navigate · click thread line to collapse