tokens: Finally , since O ( ( n^2 + n ) /2 ) = O(n^2) you get that the terms that include the sum dominate the runtime and that is why the algorithm is O(n^2)
ner_tags: O O O B-Code_Block I-Code_Block B-Code_Block I-Code_Block I-Code_Block I-Code_Block I-Code_Block B-Code_Block I-Code_Block I-Code_Block I-Code_Block O O O O O O O O O O O O O O O O O O O B-Code_Block