If you use NetScaler you will want to see these guides. The NetScaler How To Guides show administrators how to get NetScaler up and configured by providing instructions for common scenarios and some not so common ones.

Solved

Posted on 2011-10-01

My algorithms textbook says that out of the functions below, N grows the fastest, followed by log^2 N, followed by, log N, and followed by the constant c which has the slowest rate of growth. Why does log log^2 N grow slower than the linear N? I don't really understand what log^2 N is...

c

log N

log^2 N

N

c

log N

log^2 N

N

Question has a verified solution.

If you are experiencing a similar issue, please ask a related question

Title | # Comments | Views | Activity |
---|---|---|---|

Probability | 2 | 58 | |

Word Problem | 4 | 82 | |

Math question | 3 | 87 | |

Calculating bins of different widths using a summery plot in a Nspire CX Cas | 2 | 16 |

Join the community of 500,000 technology professionals and ask your questions.