Sequences & Summations

We know that n! nn so log(n!) log(nn)= nlogn So choose k = 1, C = 1 Time Complexity We can use Big-O to find the time complexity of algorithms (i.e., how long they take in terms of the number...

Author:
Uploaded by: Murkka Svensdottir
Filesize: 194 KB