zeroArn

摘要： //the first k elements interviewed and rejected, //for the latter n-k elements ,if value >max,return value, else return n'elements. #include<stdio.h># 阅读全文

摘要： T(n)=aT(n/b)+f(n); where we can interpret n/b to mean either floor(b/n) or ceil(b/n), Then T (n) has the following asymptotic bounds: 1. If f (n)= O(n 阅读全文