That's a good one, the IOCCC. I don't do it for job security though, and I don't go to the extent of using #define solely for illegibility.
The only time I delighted in making code as tricky as could be done in Coffee in a job for a customer, was when I had been put under a young project leader that was treating me like an idiot and there wasn't much chance of otherwise changing her attitude. Boss thought the world of her but imv she was little more than a student and certainly not enough of a genius to justify being so haughty. It was a non-trivial thing anyway but I was packing as much as I could into single expressions and so on. One evening she tried looking at it because of new specs, when I had left for home, she had hoped to make a little change or two herself and she had a fit. It caused a great row but eventually she realized she had no grounds to treat me that way.
Quote:
|
Originally Posted by alexander
thats so easy to do though. I am trying to learn to take it easy with him, if he posts something that enrages you, ignore it, just post your thoughts in peace.
|
Yeah, I'm tring to ignore his outright insolence while showing that my execution times are good.
Quote:
|
Originally Posted by alexander
but i've also been writing a large number class that would easily allow me to do math with large inegers, so far adding 2 10000 digit positive numbers with their generation takes less than 1/2 a second, but my multiplication process is crapping out, some logic flaw that's bothered me for a while, so i've been avoiding it hoping to get a revealing idea about how to do it all better...
|
I developed a class Rational, which uses a class Looong, but there is still room for improvement. Looong can add and subtact integers of over a thousand bytes, it would be straightforward to change the max length, it builds them up by multiplying unsigned longs each with an exponent and it is used by Rational to factorize the results. Instead of giving Looong full arithmetic, Rational has it but this implies the sometimes heavy factoring after algebric sums with the limit on prime factors.
For your query about the count of a number's factors, prime and not prime, I thought it would be a good idea for Rational to also give users a way of iterating over the prime factors, without making the class fragile. This could be done easy enough, when I get round to it.
