Tag big-o - Esta é a página 3 - GeneraCodice

How to solve Big-O Notation for prime number function?

https://www.generacodice.com/pt/articolo/13432486/how-to-solve-big-o-notation-for-prime-number-function

  c#  -  algorithm  -  big-o

StackOverflow

Which is better: O(n log n) or O(n^2)

https://www.generacodice.com/pt/articolo/13405528/which-is-better-o-n-log-n-or-o-n-2

  algorithm  -  complexity-theory  -  big-o  -  time-complexity

StackOverflow

When working with Mergesort, quicksort etc, is O(n log n) base 2, or base 10?

https://www.generacodice.com/pt/articolo/13395106/when-working-with-mergesort-quicksort-etc-is-o-n-log-n-base-2-or-base-10

  big-o  -  quicksort  -  time-complexity

StackOverflow

What is the (worst-case) time analysis for the following loop?

https://www.generacodice.com/pt/articolo/13386640/what-is-the-worst-case-time-analysis-for-the-following-loop

  time  -  java  -  big-o  -  analysis

StackOverflow

Analysis of a specific algorithm running time with recursion

https://www.generacodice.com/pt/articolo/13383883/analysis-of-a-specific-algorithm-running-time-with-recursion

  algorithm  -  big-o  -  runtime

StackOverflow

Creating worse case scenarios with kruskal's algorithm

https://www.generacodice.com/pt/articolo/13361785/creating-worse-case-scenarios-with-kruskal-s-algorithm

  algorithm  -  c++  -  testing  -  big-o  -  kruskals-algorithm

StackOverflow

Is there a O(n) way to draw a 2-D array grid instead of O(n²) in C?

https://www.generacodice.com/pt/articolo/13361314/is-there-a-o-n-way-to-draw-a-2-d-array-grid-instead-of-o-n²-in-c

  algorithm  -  c  -  arrays  -  big-o

StackOverflow

Why is my bitmap sort not infintely faster than my mergesort?

https://www.generacodice.com/pt/articolo/13360942/why-is-my-bitmap-sort-not-infintely-faster-than-my-mergesort

  algorithm  -  java  -  big-o  -  mergesort  -  bitmap

StackOverflow

Solving the similar recurrence: T(n) = 3T(n/3) + n/3

https://www.generacodice.com/pt/articolo/13345888/solving-the-similar-recurrence-t-n-3t-n-3-n-3

  algorithm  -  big-o  -  recurrence

StackOverflow

What is the big-Oh runtime of two recursive O(logn) calls?

https://www.generacodice.com/pt/articolo/13322305/what-is-the-big-oh-runtime-of-two-recursive-o-logn-calls

  python  -  recursion  -  big-o  -  logarithm

StackOverflow

• «
• 1
• 2
• 3
• 4
• 5
• 6
• »

Resultados encontrados: 1974