What is the runtime complexity of Adam's famous string splitter code? Hint: Make sure to look into the source code for string.find() in the C++ std library. Ive included that code (downloaded from GNU).

static vector ring text string delimiter vector ring pieces int location text, (delimiter); inte start 0; //while we find something interesting while location string DRos)f build substring string piece text substr (start location start); (piece start location 1 //find again location ext find deli miter start); string piece text substr (start location start); pieseswRush bask (piece return pieces