Time complexity of an iteration algorithm
===

I have an iteration algorithm, where at each iteration the amount of computation decrease gradually. Here is an illustration of my algorithm:

`Input size: n` and `Total iteration = k`

    iter 1: time taken -> f1 * n
    iter 2: time taken -> f2 * n
    iter 3: time taken -> f3 * n
    ...
    iter k: time taken -> fk * n

where `f1 > f2 > f3 >...> fk` and `0 <= f1, f2,...,fk <= 1`

Question: What is the time complexity of this algorithm? is it `Big-O(klog n)`

Thank you.
 