The next C standard is established and it’s slowly being implemented. If you have the latest version of the C compiler installed on your system, you can take advantage of some of the fun and improved features of the C programming language.
Continue reading
I’m continually amazed when I discover some aspect of the C programming language that I’ve not encountered before. This time, the trick is how to initialize individual array elements.
Continue reading
Tetration is a bizarre mathematical concept. I’ve watched quite a few YouTube videos where math geeks explain the details. They venture into the terrifying territory of humongous numbers that would consume the known universe. Your programming challenge for this month’s Exercise is far less massive.
Continue reading
Scanning the digital dictionary is fun, but it’s gone on way too long! I was going to end this series with code that solves the Spelling Bee game, but decided to end things with this Lesson. This final post scans the dictionary for words that match a given clutch of characters.
Continue reading
Tetration is a mathematical process that generates obnoxiously huge numbers quickly. It’s exponentiation on overdrive. The concept is insane, but it’s also something you can code in C.
Continue reading
I introduced the pangram concept in last week’s Lesson. The code demonstrated how to locate 7-letter words where no letter repeats, based on the online game Spelling Bee. But a pangram need not be limited to just seven letters.
Continue reading
I’m a fan of the online game Spelling Bee. In this game, you use a combination of seven letters to spell various words. Each word is at least four-letters long and must contain a special letter, shown in the center of Figure 1. When you create a word that contains all seven letters, you’ve discovered a pangram.
Continue reading
Not all the nasty words are four letters long, but a good chunk of them are. If you ran the program from last week’s Lesson, you can quickly check the computer’s dictionary for the words you once couldn’t say on TV, gleefully typing them in and confirming that they exist in the dictionary. But how many four letter words are there?
Continue reading
I hope you came up with an interesting solution for this month’s Exercise, one different from my own. The goal is to output unique values from zero through ten billion, values where no two digits repeat.
Continue reading
At the basic level, a spell-checker works as a simple comparison program: The word in question is compared with each word in the dictionary. When the source word isn’t found, it’s assumed to be misspelled. With a dictionary file on your computer, it’s easy for a C programmer to code this type of program.
Continue reading