Time complexity for recursive function with random input : <p>I'm a beginner in C programming so i need some help for my time complexity function.</p>

<pre><code>int function(int n)
{ if (n &lt;= 1)
    return n;
int i = random(n-1);
return test(i) + test(n - 1 - i);
}
</code></pre>

<p>I don't know how to deal with this problem because of the random function which have O(1) complexity which return randomly numbers.</p>
