How fast does the NATO phonetic alphabet go through letters?

So I saw a thread on reddit about people using phrases like usual “quick brown fox” one to test out fountain pens and it got me to thinking, I normally use the NATO phonetic alphabet to test my pens out but how fast does that go through all the letters of the alphabet.  After some banging around I came up with code that figures it out, just without all the hassle of actually trying to time it.

#!/usr/bin/python3

alphabet = 'abcdefghijklmnopqrstuvwxyz'

chars = list(alphabet)

words = ['alpha','bravo','charlie','delta','echo','foxtrot','golf','hotel','india','juliett','kilo','lima','mike','november','oscar','papa','quebec','romeo','sierra','tango','uniform','victor','whiskey','xray','yankee','zulu']

for w in words:
    # loop through each word specified
    for cw in w:
        # now we work through each character in the word
        if cw in chars:
            chars.remove(cw)
        else:
            pass
        print(chars)
    print(w)

print(chars)

Turns out that it really doesn’t use up everything until the very end but by the time you get to the word papa all but 4 letters have been used already.

['q', 's', 'w', 'y', 'z']
['q', 'w', 'y', 'z']
['q', 'w', 'y', 'z']
['q', 'w', 'y', 'z']
['q', 'w', 'y', 'z']
oscar
['q', 'w', 'y', 'z']
['q', 'w', 'y', 'z']
['q', 'w', 'y', 'z']
['q', 'w', 'y', 'z']
papa

So as a way to work through all the letters of the alphabet its really not the most efficient way to go but perhaps there are better phrase combinations than the quick brown fox?

Close Bitnami banner
Bitnami