| C68 Compiler Benchmarks |
In QHJ #3, I reported on some benchmarks that I ran on Lattice C and Small-C. Now that I had C68, I decided to run the benchmarks against it to see how it compares with the other two compilers. Here is how all three compilers compare: Prime Numbers Small-C Lattice C C68 29000-32767 5 Sec |
Sinclair QL |
| Dutch Connection 2 |
Last issue Mark Martin reported on a Dutch BBS that was being run on a QL. I forgot to mention that the same person that wrote the QL BBS also wrote a number of other programs, that Mark has sent me. The three major programs on the disk are: UNZIP96, QVIEW, and QBOX. UNZIP96 is |
Sinclair QL |
| Editor's Forum |
This issue of the QHJ is a little late. It’s been three months since the last issue. I try to get an issue out every two months. The reason for the delay is the arrival of my daughter, Caitlan Anne. The Tech Specs are: born 27 Sept, 5 lbs 2 oz, blonde hair and blue |
Sinclair QL |
| Italian Software |
While looking at the archives for the comp.sources.misc newsgroup on Usenet I noticed that there had been a posting on tools for the QL. I was able to download the posting and get the tools. The programs came from Giuseppe “Beppe” Zanetti of Italy. Giuseppe has written a number of programs, including the ones posted |
Sinclair QL |
| Levenstein Distance |
The Levenstein Distance is a measure of how close two strings are to each other. The Levenstein Algoritm is used to calculate the Levenstein Distance. The Levenstein Algorithm takes two strings and determines what it would take to transform one string into the other, using deletions, additions, and changing characters. The more that must be |
Sinclair QL |
| QDOS Rights |
A new item I learned this month is that the QDOS rights to North America is held by Mechanical Affinity. I wrote Frank Davis trying to learn more about this. I specifically asked him if the rights to QDOS include creating a new QL. He responded by saying that he was not too sure. The |
Sinclair QL |
| RPN Calculator |
Reverse Polish Notation (RPN) is mathmatical convention for handling expressions. RPN is most commonly found in Hewlett-Packard calculators. RPN, like Forth and Postscript, is stack oriented. Operators only handle data stored on the stack. The infix (or normal) expression 3 + 5 would be expressed as 3 5 +. Note the operator goes at the |
Sinclair QL |
| Substring Searching in C |
The December 1988 issue of “Computer Language” had an article on substring searching in C, based on an APL algorithm. One interesting feature of the substring search function is that it returned a array that pointed to all occurances of the substring in the string. Some algorithms only return the first occurance of the substring. |
Sinclair QL |
