title: Is this technically an O(1) algorithm for "Hello World"?
body: <p>Would this be classified as an O(1) algorithm for "Hello, World!" ??</p>
  
  <pre><code>public class Hello1
  {
     public static void Main()
     {
        DateTime TwentyYearsLater = new DateTime(2035,01,01);
        while ( DateTime.Now &lt; TwentyYearsLater )
        { 
            System.Console.WriteLine("It's still not time to print the hello ...");
        }
        System.Console.WriteLine("Hello, World!");
     }
  }
  </code></pre>
  
  <p>I'm thinking of using the </p>
  
  <pre><code>DateTime TwentyYearsLater = new DateTime(2035,01,01);
  while ( DateTime.Now &lt; TwentyYearsLater )
  { 
     // ... 
  }
  </code></pre>
  
  <p>snippet of code as a busy loop to put in as a joke whenever someone asks for an algorithm of a certain complexity. Would this be correct?</p>