Online PHP editor | perf for 8vefS

<?php /** * Задача: проверить, строка-предложение в переменной $pangram - это настоящая панграмма или нет? * (Правда ли включает в себя каждую букву данного алфавита $alphabet хотя бы 1 раз?) * * A Pangram (Greek: παν γράμμα, pan gramma, "every letter") or holoalphabetic sentence for a given * alphabet is a sentence using every letter of the alphabet at least once. * Source: wikipedia.org https://en.wikipedia.org/wiki/Pangram */ $alphabet = "abcdefghijklmnopqrstuvwxyz"; // English alphabet $alphabet_array = str_split(strtolower($alphabet)); $pangram = strtolower("Grumpy wizards make toxic brew for the evil Queen and Jack."); // English pangram $cnt = ''; $$cnt = 0; $array = array(); while(!empty($alphabet_array)){ $cnt = array_shift($alphabet_array); $$cnt = substr_count($pangram, $cnt); if($$cnt != 0){ $array["$cnt"] = $$cnt; }else{ echo "This is not a real pangram! $cnt is not found in this sentence."; exit; } } ksort($array); echo count($alphabet_array) . count($array)); foreach($array as $letter=>$occurrence){ echo "$letter was used " , ($occurrence==1)?"once \n":"$occurrence times \n"; }

Version	System time (s)	User time (s)	Memory (MiB)
7.0.8	0.130	0.067	19.89
7.0.7	0.030	0.073	19.89
7.0.6	0.030	0.070	19.98
7.0.5	0.037	0.063	20.38
7.0.4	0.073	0.073	20.36
7.0.3	0.110	0.080	20.32
7.0.2	0.103	0.070	20.34
7.0.1	0.037	0.057	20.40
7.0.0	0.053	0.087	20.33
5.6.23	0.007	0.073	20.75
5.6.22	0.013	0.060	20.58
5.6.21	0.013	0.097	20.49
5.6.20	0.013	0.063	21.08
5.6.19	0.017	0.070	21.09
5.6.18	0.017	0.080	21.20
5.6.17	0.017	0.070	21.13
5.6.16	0.013	0.067	21.06
5.6.15	0.017	0.073	21.13
5.6.14	0.017	0.057	21.08
5.6.13	0.020	0.057	21.04
5.6.12	0.007	0.083	21.08
5.6.11	0.013	0.073	21.16
5.6.10	0.030	0.073	21.14
5.6.9	0.020	0.080	21.12
5.6.8	0.027	0.047	20.46
5.6.7	0.013	0.063	20.52
5.6.6	0.013	0.060	20.47
5.6.5	0.010	0.070	20.52
5.6.4	0.020	0.067	20.51
5.6.3	0.023	0.060	20.46
5.6.2	0.017	0.073	20.38
5.6.1	0.017	0.083	20.48
5.6.0	0.027	0.067	20.42