Programming question

[Philippe TEISSIER <philippe.teissier@fnac.net>]

Title: Programming question

Hi

I have 2 programming exercises to solve and I can't find any solution:

The first is : 
 - Write a program with a complexity of n=log(n)

Can someone explain me that, and give me an example of a such program?


The second is:
 - Write a "pattern Beta" similar to the following Haskell Function
            f n = product $ filter [1..n]

  I don't know haskell but i think this code means something like
        (define (f n)
            (apply * (filter odd? (iota 1 n))))
        with a function iota giving the list of the numbers between 1 and n both included.

Am I right?

Thanx a lot,

-- 
   Philippe Teissier
____________________
  philippe.teissier@fnac.net

   ** ICQ : 16946127 **

___________________________________________

• Faire du ski dans le sud de la France:
  

Ski Club de Nice

http://www.chez.com/skiclub/index.html

___________________________________________