h[0] = 1,  h[1] = 0, and h[n] = -2*(n-1)*h[n-2].

1. Draw a flowchart for the algorithm to compute a list of the first 100 Hermite numbers.

   Answer:

       +------------------+
       | L = [1,0]; n = 2 |
       +------------------+
                |
     +------>  \|/
     |       ^^^^^^^^
     |      /        \
     |     / n < 100? \   no     +-----------+
     |     \          / ------>  |  print L  |
     |      \--------/           +-----------+
     |          |
     |          | yes
     |         \|/
     |    +---------------------------+
     |    | L.append(-2*(n-1)*L[n-2]) |
     |    +---------------------------+
     |                 |
     |                \|/
     |           +-------------+
     |           |  n = n + 1  |
     |           +-------------+
     |                 |
     |                \|/
     |                 |
     +-----------------+
   
   

2. Give the corresponding Python code for this algorithm.

   Answer:

      L = [1,0]
      for n in range(2,100): 
         L.append(-2*(n-1)*L[n-2])
   
      print L  # optional