*************** EEJS\EasyEx\HelloWo\   Write\   Program\
*************** HelloWo1.HTM ***************
<SCRIPT>
   document.write (   'Hello World...'   );
</SCRIPT>
*************** HelloWo5.HTM ***************
<SCRIPT>
   document.writeln (   'Hello World.....'  +  '<BR>'   );
   document.writeln (   'Hello World.....'  +  '<BR>'   );
   document.writeln (   'Hello World.....'  +  '<BR>'   );
   document.writeln (   'Hello World.....'  +  '<BR>'   );
   document.writeln (   'Hello World.....'  +  '<BR>'   );
</SCRIPT>
*************** HelloWo9.HTM ***************
<SCRIPT>
   var  i ;

   //----- LOOP
   for ( i = 1 ; i <= 9 ; i++ )  {
      document.writeln (   'Hello World.........'  +  '<BR>'   );
   }
</SCRIPT>
*************** Writ2x2.HTM ***************
<SCRIPT>
   document.write (   2 + 2   );
</SCRIPT>
*************** WritCalc.HTM ***************
<SCRIPT>
   var  R ;
   var  C , A ;

   R = 10 ;

   C = 2 * Math.PI * R ;
   A = Math.PI * R * R ;

   document.writeln (   'Radius='         +  R  +  '<BR>'   );
   document.writeln (   'Circumference='  +  C  +  '<BR>'   );
   document.writeln (   'Area='           +  A  +  '<BR>'   );
</SCRIPT>
*************** WritMsg.HTM ***************
<SCRIPT>
   var  MyMsg ;

   MyMsg =  '- Nice weather, isn\'t it ?'  +  '\r\n'
          + '- Yes "nice" weather.'        +  '\r\n' ;

   document.write (   MyMsg.replace( /\r\n/g , '<BR>\r\n')   );
</SCRIPT>
*************** Chr20_FF.HTM ***************
<SCRIPT>
   var  i ;

   document.write (   '***** CHARS: '   );

   //----- LOOP
   for ( i = 32 ; i <= 255 ; i++ )  {
      document.write (   String.fromCharCode(i)   );
   }
</SCRIPT>
*************** PrimeNb.HTM ***************
<SCRIPT>
   var  IsPrimeArray = new Array(1000);
   var  i ;
   var  j , jMax ;

   document.write (   '***** PRIME NUMBERS: '   );

   //----- LOOP 1 , On each number
   for ( i = 1 ; i <= 1000 ; i++ )  {

      //----- Could be a prime number
      IsPrimeArray[i] = true ;

      j    = 2 ;
      jMax = Math.floor ( i / 2 );

      //----- LOOP 2 , Search a divisor
      while (IsPrimeArray[i] && (j <= jMax))  {
         //----- "j" can divide "i" ?
         if ((i % j) == 0)
            IsPrimeArray[i] = false ;
         j++ ;
      }

      //----- Display only prime numbers
      if (IsPrimeArray[i] == true)
         document.write (   i  ,  ' '   );
   }

/*
   [<--                   i                      -->]
    [<-- j -->]
   .#.....................#.........................#
    |         |                                     |
    2      i div 2                                1000
*/
</SCRIPT>
