Comments on: Z-Day: The Morning After (More or Less) http://www.mobilitysite.com/2009/01/z-day-the-morning-after-more-or-less/ Mobile News, Reviews, and Views. Fri, 11 Dec 2009 20:15:20 -0600 http://wordpress.org/?v=2.8.6 hourly 1 By: steve laser http://www.mobilitysite.com/2009/01/z-day-the-morning-after-more-or-less/comment-page-1/#comment-14497 steve laser Tue, 06 Jan 2009 23:38:37 +0000 http://mobilitysite.com/2009/01/z-day-the-morning-after-more-or-less/#comment-14497 Good call Pony! Glad your education is helping us! Good call Pony! Glad your education is helping us!

]]> By: Pony99CA http://www.mobilitysite.com/2009/01/z-day-the-morning-after-more-or-less/comment-page-1/#comment-14478 Pony99CA Tue, 06 Jan 2009 02:05:53 +0000 http://mobilitysite.com/2009/01/z-day-the-morning-after-more-or-less/#comment-14478 Oops, that should "days == 366". I now get a compiler error.... :D Steve Oops, that should “days == 366″. I now get a compiler error…. :D

Steve

]]> By: Pony99CA http://www.mobilitysite.com/2009/01/z-day-the-morning-after-more-or-less/comment-page-1/#comment-14477 Pony99CA Tue, 06 Jan 2009 02:04:32 +0000 http://mobilitysite.com/2009/01/z-day-the-morning-after-more-or-less/#comment-14477 In the loop, they needed another else statement, as shown highlighted below: while (days > 365) { if (IsLeapYear(year)) { if (days > 366) { days -= 366; year += 1; } <b>else { if (day == 366) break; }</b> } else { days -= 365; year += 1; } } Of course, I'm not so sure why they need ugly loops like that. In high school, my programmable calculators worked by converting the Gregorian date (anything past somewhere in 1582) to a Julian number. The programmers should have done that with January 1, 1980, added the days, then done the Julian number-to-Gregorian date conversion. I don't know which would be faster, but the looping algorithm is O(n) where (if I remember correctly) the Julian number conversions were O(1). I need to use my Computer Science degree somewhere, right? :D Steve In the loop, they needed another else statement, as shown highlighted below:

while (days > 365) {
if (IsLeapYear(year)) {
if (days > 366) {
days -= 366; year += 1;
} else {
if (day == 366) break;
}
} else {
days -= 365; year += 1;
}
}

Of course, I’m not so sure why they need ugly loops like that. In high school, my programmable calculators worked by converting the Gregorian date (anything past somewhere in 1582) to a Julian number. The programmers should have done that with January 1, 1980, added the days, then done the Julian number-to-Gregorian date conversion.

I don’t know which would be faster, but the looping algorithm is O(n) where (if I remember correctly) the Julian number conversions were O(1).

I need to use my Computer Science degree somewhere, right? :D

Steve

]]>