PRESS THE GREEN FLAG TWICE, NOT ONCE! This runs the PWSC algorithm to calculate the similarity of a string of lengths 1-50, two thousand times per each length. In the list "Times" is written the number of seconds it took your computer to compare a string of increasing length to its own self, 2,000 times over. The 1st item of the list represents 2,000 1-character string operations, the 2nd represents 2,000 2-character string operations, and so on. The benchmark may take up to a couple minutes depending on your machine. Here are the results on my iPad mini 5, which is already far past its prime: (seconds - lengths 1 to 50 - total time 108.084 s) 0 0.071 0.104 0.107 0.167 0.212 0.279 0.349 0.415 0.536 0.561 0.683 0.817 0.856 0.996 1.139 1.258 1.326 1.46 1.562 1.749 1.905 2.099 2.322 2.445 2.573 2.798 2.972 3.206 3.382 3.469 3.866 4.149 4.295 4.557 5.077 5.223 5.784 5.948 6.53 6.613 6.746 6.863 7.275 7.75 8.17 8.622 9.041 9.72 10.037
