Your code must consider whether or not command line options are present, that the user may type the options in any order, and that some or all of the option could be incorrect. That makes for a lot of processing, but it’s also forgiving and users prefer the flexibility.
Continue reading
I went bowling the other day. Actually, I went to watch people bowl. I’m a terrible bowler, having never rolled anything higher than 148 in my life. Breaking 100 is a rare occasion. But one thing I can do well is understand how the scoring works.
Continue reading
When processing the main() function’s arguments, you must keep in mind the possibilities. Options are, after all, options. They might be there, they might not.
Continue reading
About a year ago, I wrote a post on reading the command line arguments. It’s a process that takes place all the time, not only when running programs in a terminal window but also for graphical operating systems. Knowing how to manipulate command line arguments is important.
Continue reading
I’ll confess that when I use a quicksort to sort and array of strings, I don’t use the C Library’s qsort() function. No, I write my own. The problem is that when sorting an array of strings, the qsort() function’s compar argument is a pain in the butt to craft properly.
Continue reading
A chessboard is merely a two-dimensional array — a matrix — one where the rows and columns are the same size. As long as you can write code to output an 8-by-8 board, you can modify the code to reset the board’s size to any value.
Continue reading
The quicksort deftly handles vast quantities of values. It can also sort strings, but that’s where things can get weird.
Continue reading
Thanks to Mr. Spock (and God bless you, Mr. Nimoy!), many people think of Chess when they think of computer programming. Unlike mankind’s favorite Vulcan, coding your own computer chess game would be a tremendous undertaking. Even so, you can start with the basics and write a program that outputs a chessboard.
Continue reading
The Internet is littered with plenty of good explanations of how the quicksort works. The definition at Wikipedia graphically illustrates the process, which is commonly called “divide and conquer.” I’ve stolen the Wikipedia illustration and placed it into Figure 1.
Continue reading
Computers excel at searching and sorting. That, and they can occasionally screw up a phone bill.
Continue reading